• CYCLE RELATED MAGIC GRAPHOIDAL GRAPHS

S. SUBHASHINI*, K. NAGARAJAN

Abstract


B. D. Acharya and E. Sampathkumar [1] defined Graphoidal cover as partition of edge set of G into internally disjoint paths (not necessarily open). The minimum cardinality of such cover is known as graphoidal covering number of G. Let G = (V, E) be a graph and let ψ be a graphoidal cover of G. Define f: V E → {1, 2, 3, ..., p + q} such that for every path P = (v0v1v2…vn) in ψ with f*(P) = f(v0) + f(vn) + = k, a constant, where f* is the induced labeling on ψ. Then, we say that G admits ψ - magic graphoidal total labeling of G. A graph G is called magic graphoidal if there exists a minimum graphoidal cover ψ of G such that G admits ψ - magic graphoidal total labeling. In this paper, we proved that Cn P1, B3t, Gn, S(Cn K1) and S(Cn × K2) are magic graphoidal.


Keywords


Graphoidal Cover, Magic Graphoidal, Graphoidal Constant.

Full Text:

PDF


Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
© 2010-2020 International Journal of Mathematical Archive (IJMA)
Copyright Agreement & Authorship Responsibility
Web Counter