http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
1-edge balance index sets of C_n tines P_3 and K_{n,n}
Vinutha S . V.,Shrikanth A. S.,Ramananda H. S. 장전수학회 2019 Proceedings of the Jangjeon mathematical society Vol.22 No.3
Let G be a graph with vertex set V , edge set E and Z2 = {0, 1}. Let f be a labeling from E to Z2, so that the labels of the edges are 0 or 1. The edges labelled 1 are called 1-edges and edges labelled 0 are called 0-edges. The edge labeling f induces a vertex labeling f : V −! Z2 defined by f(v) = ( 1 if the number of 1-edges incident on v is odd, 0 if the number of 1-edges incident on v is even. For i 2 Z2 let ef (i) = e(i) = card{e 2 E : f(e) = i} and vf (i) = v(i) = card{v 2 V : f(v) = i}. A labeling f is said to be edge-friendly if | e(0) − e(1) | 1. The 1- edge balance index set (OEBI) of a graph G is defined by {| vf (0) − vf (1) | : the edge labeling f is edge-friendly}. The main purpose of this paper is to completely determine the 1-edge balance index sets of Cn × P3, Kn,n.