DocumentCode :
3539550
Title :
On the edge-balance index sets of a classes of nested network graph
Author :
Zheng, Yuge ; Tian, Hongjuan
Author_Institution :
Henan Polytech. Univ., Jiaozuo, China
fYear :
2012
fDate :
14-15 Aug. 2012
Firstpage :
170
Lastpage :
174
Abstract :
The research of Boolean index sets of graphs is one of the important graph theory in the graph theory . Boolean index sets of graphs are to use the vertex sets and the edge sets of graphs to study the characteristics of various graphs and their inherent characteristics through corresponding the mapping function to Z2. It´s theory can be applied to information engineering, communication networks, computer science, economic management, medicine, etc. The edge-balance index set is an important issue in Boolean index set. In this paper, we defined edge-friendly labeling of the graph, edge-balance index set of the graph and the graph Cnm × Pmn (n=4,m≥2). We completely determine the edge-balance index sets of the graph Cnm × Pmn(m ≡ 0(mod 3)) and solve formula proof and graphic tectonic methods.
Keywords :
graph theory; Boolean index set; edge-balance index set; edge-friendly labeling; graph theory; graphic tectonic method; mapping function; nested network graph; vertex sets; Educational institutions; Electronic mail; Graph theory; Indexes; Labeling; Manganese; Shape; edge-balance index set; edge-friendly labeling; nested graph;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Uncertainty Reasoning and Knowledge Engineering (URKE), 2012 2nd International Conference on
Conference_Location :
Jalarta
Print_ISBN :
978-1-4673-1459-6
Type :
conf
DOI :
10.1109/URKE.2012.6319537
Filename :
6319537
Link To Document :
بازگشت