본문 바로가기
KERD
논문KCI 등재

On Edge-balance Index Sets of N cycles Three Nested Graph (n = 0, 1, 2 (mod6))

0

조회

0

다운로드

0

인용

0

참고문헌

키워드

주제분류수학

초록

Let G be a simple graph with vertex set V (G) and edge set E(G), and let Z_2 ={0, 1}. For a given binary labeling f : E(G) → Z_2, the edge labeling f induces a partial vertex labeling f^* : V (G) → Z_2 such that f^*(v) = 1(0) iff the number of 1-edges(0-edges) is strictly greater than the number of 0-edges(1-edges) incident to v, otherwise f^*(v) is not de¯ned. For i ∈ Z_2, let vf (i) = v(i) = card{v ∈V (G) : f^*(v) = i} and ef (i) = e(i) = card{e ∈ E(G) : f(e) = i}. The edge-balance index set of the graph G, EBI(G), is de¯ned as {|vf (0)-vf (1)| :the edge labeling f is edge-friendlyg. The graph C_n × P_3 is said that three cycles are linked with n paths. In this paper,we will research a structural method of the edge-balance index set of n cycles three nested graph (n≡0, 1, 2(mod6)).

Abstract

Let G be a simple graph with vertex set V (G) and edge set E(G), and let Z_2 ={0, 1}. For a given binary labeling f : E(G) → Z_2, the edge labeling f induces a partial vertex labeling f^* : V (G) → Z_2 such that f^*(v) = 1(0) iff the number of 1-edges(0-edges) is strictly greater than the number of 0-edges(1-edges) incident to v, otherwise f^*(v) is not de¯ned. For i ∈ Z_2, let vf (i) = v(i) = card{v ∈V (G) : f^*(v) = i} and ef (i) = e(i) = card{e ∈ E(G) : f(e) = i}. The edge-balance index set of the graph G, EBI(G), is de¯ned as {|vf (0)-vf (1)| :the edge labeling f is edge-friendlyg. The graph C_n × P_3 is said that three cycles are linked with n paths. In this paper,we will research a structural method of the edge-balance index set of n cycles three nested graph (n≡0, 1, 2(mod6)).

참고문헌 (7)

  1. Yuge Zheng, "On the edge-balance index sets of Cn x P2", 2010 Interna-tional Conference on Network and Digital Society, 통권 : 2, pp.360~363 (2010)
  2. Zheng Yuge, "On the perfect index sets of the chain-sum graphs of the first kind of K4-e", 2009 2nd International Conference on In-telligent Computing Technology and Autination,icicta 2009, 통권 : 4, pp.586~589 (2009)
  3. M.C.Hong, "On the edge-balanced graphs", Proceeding of the 7 th Quadrennial International Conference on the Theory anf Applications of Graphs, 통권 : 2, pp.711~722
  4. Yu Guangming, "On the intensity and type transition of land use at the basin scale using RS", GIS:A case study of the Hanjiang River Basin, 2010, pp.160(1), 169~179
  5. Harris Kwong, "On Friendly Index Sets of 2-regular graphs", iscrete Mathematics, 308, pp.5522~5532 (2008)
  6. Suh-Ryung Kim, "On Balancedness of Some Graph Constructions", Journal of Combinatorial Mathematics and Combinatorial Computing, 66, pp.3~16 (2008)
  7. AleLee, "On The Balance Index Set of Graphs", Journal of Combinatorial Mathematics and Combinatorial Computing, 66, pp.135~150 (2008)

관련 논문AI추천

이 간행물의 다른 논문 (12건)