On friendly index sets of k-galaxies
暂无分享,去创建一个
Let G = ( V , E ) be a graph. A vertex labeling f : V → Z 2 induces an edge labeling f * : E → Z 2 defined by f * ( x y ) = f ( x ) + f ( y ) , for each edge x y ∈ E . For i ∈ Z 2 , let v f ( i ) = ∣{ v ∈ V : f ( v ) = i }∣ and e f ( i ) = ∣{ e ∈ E : f * ( e ) = i }∣ . We say that f is f r i e n d l y if ∣ v f (1) − v f (0)∣ ≤ 1 . The friendly index set of G , denoted by FI ( G ) , is defined as FI( G ) = ∣ e f (1) − e f (0)∣ : vertex labeling f is friendly . A k -galaxy is a disjoint union of k stars. In this paper, we establish the friendly index sets for various classes of k -galaxies.
[1] Joseph A. Gallian,et al. A Dynamic Survey of Graph Labeling , 2009, The Electronic Journal of Combinatorics.
[2] Sin-Min Lee,et al. On Friendly Index Sets of Bipartite Graphs , 2008, Ars Comb..
[5] Harris Kwong,et al. On friendly index sets of 2-regular graphs , 2008, Discret. Math..
[6] Gary Chartrand,et al. Uniformly cordial graphs , 2006, Discret. Math..
[7] Keith Edwards,et al. The computational complexity of cordial and equitable labelling , 2000, Discret. Math..