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

On the quick construction of all edge-balance index sets of Cn × P₂(n≡ 2, 3(mod4))

0

조회

0

다운로드

0

인용

0

참고문헌

주제분류수학

초록

In the paper, Boolean labeling function and the skill of the quick con-struction of graphs are studied. We completely determine the edge-balance index sets of Cn × P2(n ≥ 3)(n ≡ 2, 3(mod4)).

Abstract

In the paper, Boolean labeling function and the skill of the quick con-struction of graphs are studied. We completely determine the edge-balance index sets of Cn × P2(n ≥ 3)(n ≡ 2, 3(mod4)).

참고문헌 (6)

  1. Yuge Zheng, "On the perfect index sets of the chain-sum graphs of the first kind of K4-e", 2009 2nd International Confer-ence on Intelligent Computing Technology and Autination,icicta 2009, 통권 : 4, pp.586~589 (2009)
  2. Yuge Zheng, "On the Edge-balance Index Sets of Cn × P2", 2010 International Conference on Networking and Digital Society, 통권 : 2, pp.360~363 (2010)
  3. 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
  4. Harris Kwong, "On Friendly Index Sets of 2-regular graphs", iscrete Mathematics, 308, pp.5522~5532 (2008)
  5. Suh-Ryung Kim, "On Balancedness of Some Graph Constructions", Journal of Combinatorial Mathematics and Combinato-rial Computing, 66, pp.3~16 (2008)
  6. AleLee, "On The Balance Index Set of Graphs", Journal of Com-binatorial Mathematics and Combinatorial Computing, 66, pp.135~150 (2008)

관련 논문AI추천

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