Strong labelings of linear forests

A （p, q）-graph G is called super edge-magic if there exists a bijective function f ： V（G） U E（G） →{1, 2 p＋q} such that f（u）＋ f（v）＋f（uv） is a constant for each uv C E（G） and f（Y（G）） = {1,2,...,p}. In this paper, we introduce the concept of strong super edge-magic labeling as a particular class of super edge-magic labelings and we use such labelings in order to show that the number of super edge-magic labelings of an odd union of path-like trees （mT）, all of them of the same order, grows at least exponentially with m.     

Super edge-magic strength of fire crackers, banana trees and unicyclic graphs

A graph G(V,E) is called super edge-magic if there exists a bijection f from V∪E to {1,2,3,…,|V|+|E|} such that f(u)+f(v)+f(uv)=c(f) is constant for any uv∈E and f(V)={1,2,3,…,|V|}. Such a bijection is called a super edge-magic labeling of G. The super edge-magic strength of a graph G is defined as the minimum of all c(f) where the minimum runs over all super edge-magic labelings of G and is denoted by sm(G). The super edge-magic strength of some families of graphs are obtained in this paper.     

The Jumping Knight and Other (Super) Edge-Magic Constructions

Let G be a graph of order p and size q with loops allowed. A bijective function ${f:V(G)\cup E(G)\rightarrow \{i\}_{i=1}^{p+q}}$ is an edge-magic labeling of G if the sum ${f(u)+f(uv)+f(v)=k}$ is independent of the choice of the edge uv. The constant k is called either the valence, the magic weight or the magic sum of the labeling f. If a graph admits an edge-magic labeling, then it is called an edge-magic graph. Furthermore, if the function f meets the extra condition that ${f(V(G))=\{i\}_{i=1}^{p}}$ then f is called a super edge-magic labeling and G is called a super edge-magic graph. A digraph D admits a labeling, namely l, if its underlying graph, und(D) admits l. In this paper, we introduce a new construction of super edge-magic labelings which are related to the classical jump of the knight on the chess game. We also use super edge-magic labelings of digraphs together with a generalization of the Kronecker product to get edge-magic labelings of some families of graphs.     

On the Super Edge-Magic Deficiency of Graphs

A (p, q) graph G is edge-magic if there exists a bijective function f: V(G) ∪ E(G) → {1,2,…,p + q} such that f(u) + f(v) + f(uv) = k is a constant, called the valence of f, for any edge uv of G. Moreover, G is said to be super edge-magic if f(V(G)) = {1,2,…,p}. The question studied in this paper is for which graphs is it possible to add a finite number of isolated vertices so that the resulting graph is super edge-magic? If it is possible for a given graph G, then we say that the minimum such number of isolated vertices is the super edge-magic deficiency, μ_s(G) of G; otherwise we define it to be + ∞.     

灯笼图的奇优美标号

提出了灯笼图、多向灯笼图、复杂灯笼图,研究了它们的奇优美性,证明灯笼图是二分奇优美图、超级边魔幻图和超级反魔幻图.     

Labeling constructions using digraph products

In this paper we study the edge-magicness of graphs with equal size and order, and we use such graphs and digraph products in order to construct labelings of different classes and of different graphs. We also study super edge-magic labelings of 2$2$-regular graphs with exactly two components and their implications to other labelings.     

三路树P(m,n,t)是边幻图的证明(II)

令简单图G=(V,E)是有p个顶点q条边的图.假设G的顶点和边由1,2,…,p+q所标号,且f:V∪E→{1,2,…,p+q}是一个双射,如果对所有的边xy,f(x)+f(y)+f(xy)是常量,则称图G是边幻图(edge-magic).本文证明了三路树P(m,n,t)当n为偶数,t=n+2时也是边幻图.     

Some remarks on the folk theorem in game theory

It is argued that although the pathological multiplicity of Nash equilibria of super games stated by the folk theorem can be removed by introducing limited observations into super games with a continuum of players, the consideration of super games in terms of the Nash equilibrium concept involves a more fundamental and conceptual difficulty.     

集值映射最优化问题超有效解集的连通性

本文在局部凸空间中对集值映射最优化问题引入超有效解的概念．首先研究了超 有效点的一些重要特性．其后证明了当目标函数为锥类凸的集值映射时，其目标空间里 的超有效点集是连通的；若目标函数为锥凸的集值映射时，其超有效解集也是连通的．     

On Super Hamiltonian Semigroups

The concept of super hamiltonian semigroup is introduced. As a result, the structure theorems obtained by A. Cherubini and A. Varisco on quasi commutative semi-groups and quasi hamiltonian semigroups respectively are extended to super hamiltonian semigroups.     

Necessary conditions for super minimizers in constrained multiobjective optimization

This paper concerns the study of the so-called super minimizers related to the concept of super efficiency in constrained problems of multiobjective optimization, where cost mappings are generally set-valued. We derive necessary conditions for super minimizers on the base of advanced tools of variational analysis and generalized differentiation that are new in both finite-dimensional and infinite-dimensional settings for problems with single-valued and set-valued objectives.      

On super edge-magic decomposable graphs

Let G be any graph and let {H _i } _i??I be a family of graphs such that $E\left( {H_i } \right) \cap E\left( {H_j } \right) = \not 0$ when i ?? j, ?? _i??I E(H _i ) = E(G) and $E\left( {H_i } \right) \ne \not 0$ for all i ?? I. In this paper we introduce the concept of {H _i } _i??I -super edge-magic decomposable graphs and {H _i } _i??I -super edge-magic labelings. We say that G is {H _i } _i??I -super edge-magic decomposable if there is a bijection ??: V(G) ?? {1,2,..., |V(G)|} such that for each i ?? I the subgraph H _i meets the following two requirements: ??(V(H _i )) = {1,2,..., |V(H _i )|} and {??(a) +??(b): ab ?? E(H _i )} is a set of consecutive integers. Such function ?? is called an {H _i } _i??I -super edge-magic labeling of G. We characterize the set of cycles C _n which are {H ₁, H ₂}-super edge-magic decomposable when both, H ₁ and H ₂ are isomorphic to (n/2)K ₂. New lines of research are also suggested.     

超有效元意义下集值优化的最优性条件

该文在Hausdorff局部凸拓扑向量空间考虑约束集值优化问题(SOP)在超有效意义下的Fritz John条件和Kuhn-Tucker条件.首先借助集值映射的下半可微的概念给出这种空间中集值映射导数的定义, 据此讨论了超有效元的Fritz John最优性条件.最后, 给出约束集值优化问题(SOP)取得超有效元的充分条件.     

On super continuous multifunctions

We define upper (lower) super continuous multifunctions and obtain some characterizations and basic properties of such a multifunction. Also some relationships between the concept of super continuity and known concepts of continuity and strongly Θ-continuity are given. This revised version was published online in June 2006 with corrections to the Cover Date.     

Super‐wavelets on local fields of positive characteristic

The concept of super‐wavelet was introduced by Balan, and Han and Larson over the field of real numbers which has many applications not only in engineering branches but also in different areas of mathematics. To develop this notion on local fields having positive characteristic we obtain characterizations of super‐wavelets of finite length as well as Parseval frame multiwavelet sets of finite order in this setup. Using the group theoretical approach based on coset representatives, further we establish Shannon type multiwavelet in this perspective while providing examples of Parseval frame (multi)wavelets and (Parseval frame) super‐wavelets. In addition, we obtain necessary conditions for decomposable and extendable Parseval frame wavelets associated to Parseval frame super‐wavelets.     

一种新的概念格增量维护算法

形式概念分析在数据分析以及机器学习领域得到了广泛的应用,作为核心数据结构的概念格的构造算法一直是形式概念分析领域的研究热点.根据概念外延的补集性质,给出并证明了概念的生成定理和超概念的生成定理,并以此为基础提出了一种新的概念格的增量维护算法,包括概念的生成和序关系建立算法,并给出了一个应用示例.     

具有偏好锥的面向输出的超效率DEA模型分析

鉴于传统DEA模型无法区分有效决策单元,超效率DEA模型未考虑决策者的偏好,现提出面向输出的权重受限的综合超效率DEA模型及其投影概念,并讨论该模型与其他超效率DEA模型之间的关系.接着,分析模型的最优目标函数值与决策单元有效性之间的关系,并讨论面向输出的权重受限的综合超效投影与多目标规划问题的非支配解之间的关系.最后,通过对中国西部12个地区工业企业科技创新效率综合评价,并与原有方法进行比较研究,得出本文方法更具优势和合理性.     

Hilbert空间上凸函数的上、下指数的共轭性质

本文引入Ｈｉｌｂｅｒｔ空间上非负凸函数具有一般性的上下指数的概念，得到相互共轭凸函数的上下指数的共轭性质，也讨论了由内积范数导出的正ｐ（ｐ＞１）次齐次函数与正ｑ（ｑ＞１，１ｐ＋１ｑ＝１）之间的关系     

赋范线性空间集合的严有效点

本文引入一个新的有效点概念一严有效点,它是Borwein超有效点的推广.此外还讨论了严有效点的基本性质:存在性条件、纯量化特征、稠密性定理以及与Borwein超有效点的关系.     

超空时调和函数与一类非线性抛物方程

本文对超扩散过程定义了超空时调和函数并讨论了它们的某些性质，在此基础上建立了一类非线性抛物方程的正解与超空时调和函数之间的对应关系．