On friendly index sets of k-galaxies

S-M Lee, Richard M. Low, H.K. Ng, Y-C Wang

Abstract


Let G = (V, E) be a graph. A vertex labeling f : V → Z2 induces an edge labeling f *  : E → Z2 defined by f * (xy) = f(x) + f(y), for each edge xy ∈ E. For i ∈ Z2, let vf(i) = ∣{v ∈ V : f(v) = i}∣ and ef(i) = ∣{e ∈ E : f * (e) = i}∣. We say that f is friendly if ∣vf(1) − vf(0)∣ ≤ 1. The friendly index set of G, denoted by FI(G), is defined as FI(G) = ∣ef(1) − ef(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.


Keywords


friendly labeling, friendly index set, disjoint union of stars

Full Text:

PDF

DOI: http://dx.doi.org/10.5614/ejgta.2019.7.1.1

References

I. Cahit, Cordial graphs: a weaker version of graceful and harmonious graphs, Ars Combin. 23 (1987), 201–207.

N. Cairnie and K. Edwards, The computational complexity of cordial and equitable labeling. Discrete Math. 216 (2000), 29–34.

G. Chartrand, S-M. Lee and Z. Zhang, On uniformly cordial graphs, Discrete Math. 306 (2006), 726–737.

J.A. Gallian, A dynamic survey of graph labeling, Electron. J. Combin. 20 (2017), #DS6.

Y.S. Ho, S-M. Lee and H.K. Ng, On friendly index sets of root-unions of stars by cycles, J. Combin. Math. Combin. Comput. 62 (2007), 97–120.

H.Kwong, S-M.Lee and H.K. Ng, On friendly index sets of 2-regular graphs, Discrete Math. 308 (2008), 5522–5532.

S-M. Lee and H.K. Ng, On friendly index sets of bipartite graphs, Ars Combin. 86 (2008), 257–271.

S-M. Lee and H.K. Ng, On friendly index sets of total graphs of trees, Util. Math. 73 (2007), 81–95.

S-M. Lee and H.K. Ng, On friendly index sets of prisms and Mo ̈bius ladders, J. Combin. Math. Combin. Comput. 90 (2014), 59–74.

S-M.Lee, H.K.Ng and S.M.Tong, On friendly index sets of broken wheel swith three spokes, J. Combin. Math. Combin. Comput.. 74 (2010), 13–31.

E. Salehi and S-M. Lee, Friendly index sets of trees, Congr. Numer. 178 (2006), 173–183.

E.W. Weisstein, “Perfect Partition.” From MathWorld – A Wolfram Web Resource. http://mathworld.wolfram.com/PerfectPartition.html


Refbacks

  • There are currently no refbacks.


ISSN: 2338-2287

Creative Commons License
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.

View EJGTA Stats