Work place: Henan College of Industry & Information Technology, Jiaozuo, China
Research Interests: Combinatorial Optimization, Computability Theory
Jinmeng Liu: Teacher of Henan College of Industry&Information Technology， major in Graph theory and combinatorial mathematics.
DOI: https://doi.org/10.5815/ijmecs.2016.03.03, Pub. Date: 8 Mar. 2016
On the basis of power-cycle nested network graph, the edge-balanced index sets of circle union graph F(3,n) graph were investigated. A new method of changing index is provided, simplifying the proving process. It reduced the difficulty of circle union graph F(3,n) graph labeling because of the novel design of the basic graph and single-point sector subgraph. The results show that the edge-balanced index sets of circle union graph F(3,n) graph. This paper has proved the existence of the edge-balanced index sets of one class of circle union graph, the computational formulas and the construction of the corresponding graphs are also provided.[...] Read more.
DOI: https://doi.org/10.5815/ijmecs.2013.09.08, Pub. Date: 8 Sep. 2013
Based on the power-cycle nested graph brought before, using the research methods and techniques of graph theory and combinatorial mathematics, through studying the new design idea about the basic graph,nested-cycle subgraph with gear and five-vertex sector subgraph-group, the edge-balanced index sets of the power-cycle nested graph are provided here, for and , and the proofs of the computational of formulas and the construction of the corresponding graphs also give out.[...] Read more.
Subscribe to receive issue release notifications and newsletters from MECS Press journals