Let G be a graph with vertex set V（G） and edge set E（G）. A labeling f ： V（G） →Z2 induces an edge labeling f＊： E（G） → Z2 defined by f＊（xy） = f（x） ＋ f（y）, for each edge xy ∈ E（G）. For i ∈ Z2, le...Let G be a graph with vertex set V（G） and edge set E（G）. A labeling f ： V（G） →Z2 induces an edge labeling f＊： E（G） → Z2 defined by f＊（xy） = f（x） ＋ f（y）, for each edge xy ∈ E（G）. For i ∈ Z2, let vf（i） = ｜{v ∈ V（G） ： f（v） = i}｜ and ef（i） = ｜{e ∈ E（G） ： f＊（e） =i}｜. A labeling f of a graph G is said to be friendly if ｜vf（0）- vf（1）｜ ≤ 1. The friendly index set of the graph G, denoted FI（G）, is defined as {｜ef（0）- ef（1）｜： the vertex labeling f is friendly}. This is a generalization of graph cordiality. We investigate the friendly index sets of cyclic silicates CS（n, m）.展开更多
A vertex labeling f ： V →Z2 of a simple graph G = （V, E） induces two edge labelings The friendly index set and the product-cordial index set of G are defined as the setsf is friendly}. In this paper we study and d...A vertex labeling f ： V →Z2 of a simple graph G = （V, E） induces two edge labelings The friendly index set and the product-cordial index set of G are defined as the setsf is friendly}. In this paper we study and determine the connection between the friendly index sets and product-cordial index sets of 2-regular graphs and generalized wheel graphs.展开更多
Let G =（V, E） be a connected simple graph. A labeling f ： V → Z2 induces an edge labeling f＊ ： E → Z2 defined by f＊（xy） = f（x） ＋f（y） for each xy ∈ E. For i ∈ Z2, let vf（i） = ｜f^-1（i）｜ and ef（i...Let G =（V, E） be a connected simple graph. A labeling f ： V → Z2 induces an edge labeling f＊ ： E → Z2 defined by f＊（xy） = f（x） ＋f（y） for each xy ∈ E. For i ∈ Z2, let vf（i） = ｜f^-1（i）｜ and ef（i） = ｜f＊^-1（i）｜. A labeling f is called friendly if ｜vf（1） - vf（0）｜ ≤ 1. For a friendly labeling f of a graph G, we define the friendly index of G under f by if（G） = e（1） - el（0）. The set [if（G） ｜ f is a friendly labeling of G} is called the full friendly index set of G, denoted by FFI（G）. In this paper, we will determine the full friendly index set of every Cartesian product of two cycles.展开更多
In this paper, we introduce the concept of the general butterfly graph B[m,n;d] for integers m,n ≥ 3, d ≥ 1, determine its balance index set, and give the necessary and sufficient condition for balanced graph B[m,n;...In this paper, we introduce the concept of the general butterfly graph B[m,n;d] for integers m,n ≥ 3, d ≥ 1, determine its balance index set, and give the necessary and sufficient condition for balanced graph B[m,n;d] to exist.展开更多
Let G be a connected simple graph with vertex set V(G)and edge set E(G).A binary vertex labeling f:V(G)→Z2,is said to be friendly if the number of vertices with different labels differs by at most one.Each vertex fri...Let G be a connected simple graph with vertex set V(G)and edge set E(G).A binary vertex labeling f:V(G)→Z2,is said to be friendly if the number of vertices with different labels differs by at most one.Each vertex friendly labeling/induces an edge labeling f*E(G)→Z2,defined by f*(xy)=f(x)+f(y)for each xy∈E(G).Let er(i)=\{e∈E(G):f*(e)=i}|.The full friendly index set of G,denoted by FFI(G),is the set{ef*(1)-ep(0):f is friendly}.In this paper,we determine the full friendly index set of a family of cycle union graphs which are edge subdivisions of P2×Pn.展开更多
In this paper we will first give the characterization of the p^-low p^-degree,and prove that a p.r.e. degree(?)contains a p^-speedable set A if and only if(?)′>P(?)′.Then we classify the index sets of Low[n]~p an...In this paper we will first give the characterization of the p^-low p^-degree,and prove that a p.r.e. degree(?)contains a p^-speedable set A if and only if(?)′>P(?)′.Then we classify the index sets of Low[n]~p and High[n]~p and prove that Low [n]~p is Σ~P[n+3]-complete and High [n]~p is Σ~P [n+4]-complete.展开更多
Radar anti-jamming performance evaluation is a necessary link in the process of radar development,introduction and equipment. The applications of generalized rough set theory are proposed and discussed in this paper t...Radar anti-jamming performance evaluation is a necessary link in the process of radar development,introduction and equipment. The applications of generalized rough set theory are proposed and discussed in this paper to address the problems of big data, incomplete data and redundant data in the construction of evaluation index system. Firstly, a mass of real-valued data is converted to some interval-valued data to avoid an unacceptable number of equivalence classes and classification rules, and the interval similarity relation is employed to make classifications of this interval-valued data. Meanwhile, incomplete data can be solved by a new definition of the connection degree tolerance relation for both interval-valued data and single-valued data, which makes a better description of rough set than the traditional limited tolerance relation. Then, E-condition entropy-based heuristic algorithm is applied to making attribute reduction to optimize the evaluation index system, and final decision rules can be extracted for system evaluation. Finally, the feasibility and advantage of the proposed methods are testified by a real example of radar anti-jamming performance evaluation.展开更多
基金Supported by the National Natural Science Foundation of China(Grant No.11371109)
文摘Let G be a graph with vertex set V（G） and edge set E（G）. A labeling f ： V（G） →Z2 induces an edge labeling f＊： E（G） → Z2 defined by f＊（xy） = f（x） ＋ f（y）, for each edge xy ∈ E（G）. For i ∈ Z2, let vf（i） = ｜{v ∈ V（G） ： f（v） = i}｜ and ef（i） = ｜{e ∈ E（G） ： f＊（e） =i}｜. A labeling f of a graph G is said to be friendly if ｜vf（0）- vf（1）｜ ≤ 1. The friendly index set of the graph G, denoted FI（G）, is defined as {｜ef（0）- ef（1）｜： the vertex labeling f is friendly}. This is a generalization of graph cordiality. We investigate the friendly index sets of cyclic silicates CS（n, m）.
文摘A vertex labeling f ： V →Z2 of a simple graph G = （V, E） induces two edge labelings The friendly index set and the product-cordial index set of G are defined as the setsf is friendly}. In this paper we study and determine the connection between the friendly index sets and product-cordial index sets of 2-regular graphs and generalized wheel graphs.
基金Supported by FRG/07-08/II-08 Hong Kong Baptist University
文摘Let G =（V, E） be a connected simple graph. A labeling f ： V → Z2 induces an edge labeling f＊ ： E → Z2 defined by f＊（xy） = f（x） ＋f（y） for each xy ∈ E. For i ∈ Z2, let vf（i） = ｜f^-1（i）｜ and ef（i） = ｜f＊^-1（i）｜. A labeling f is called friendly if ｜vf（1） - vf（0）｜ ≤ 1. For a friendly labeling f of a graph G, we define the friendly index of G under f by if（G） = e（1） - el（0）. The set [if（G） ｜ f is a friendly labeling of G} is called the full friendly index set of G, denoted by FFI（G）. In this paper, we will determine the full friendly index set of every Cartesian product of two cycles.
基金the National Natural Science Foundation of China （No. 10671005） the Natural Science Foundation of Hebei Province （No. A2007000230）.
文摘In this paper, we introduce the concept of the general butterfly graph B[m,n;d] for integers m,n ≥ 3, d ≥ 1, determine its balance index set, and give the necessary and sufficient condition for balanced graph B[m,n;d] to exist.
基金This work was supported partly by the National Natural Science Foundation of China(Grant Nos.11801149,11801148)S.Wu was also partially supported by the Doctoral Fund of Henan Polytechnic University(B2018-55).
文摘Let G be a connected simple graph with vertex set V(G)and edge set E(G).A binary vertex labeling f:V(G)→Z2,is said to be friendly if the number of vertices with different labels differs by at most one.Each vertex friendly labeling/induces an edge labeling f*E(G)→Z2,defined by f*(xy)=f(x)+f(y)for each xy∈E(G).Let er(i)=\{e∈E(G):f*(e)=i}|.The full friendly index set of G,denoted by FFI(G),is the set{ef*(1)-ep(0):f is friendly}.In this paper,we determine the full friendly index set of a family of cycle union graphs which are edge subdivisions of P2×Pn.
文摘In this paper we will first give the characterization of the p^-low p^-degree,and prove that a p.r.e. degree(?)contains a p^-speedable set A if and only if(?)′>P(?)′.Then we classify the index sets of Low[n]~p and High[n]~p and prove that Low [n]~p is Σ~P[n+3]-complete and High [n]~p is Σ~P [n+4]-complete.
基金the Opening Project of the State Key Laboratory of Complex Electromagnetic Environment Effects on Electronics and Information System(No.CEMEE2014K0301A)
文摘Radar anti-jamming performance evaluation is a necessary link in the process of radar development,introduction and equipment. The applications of generalized rough set theory are proposed and discussed in this paper to address the problems of big data, incomplete data and redundant data in the construction of evaluation index system. Firstly, a mass of real-valued data is converted to some interval-valued data to avoid an unacceptable number of equivalence classes and classification rules, and the interval similarity relation is employed to make classifications of this interval-valued data. Meanwhile, incomplete data can be solved by a new definition of the connection degree tolerance relation for both interval-valued data and single-valued data, which makes a better description of rough set than the traditional limited tolerance relation. Then, E-condition entropy-based heuristic algorithm is applied to making attribute reduction to optimize the evaluation index system, and final decision rules can be extracted for system evaluation. Finally, the feasibility and advantage of the proposed methods are testified by a real example of radar anti-jamming performance evaluation.
