Magic Graphoidal on Class of Trees

Murugan, A. Nellai

doi:10.18052/www.scipress.com/BMSA.9.33

BMSA > BMSA Volume 9 > Magic Graphoidal on Class of Trees

< Back to Volume

Magic Graphoidal on Class of Trees

Full Text PDF

Abstract:

B.D.Acharya and E. Sampathkumar [1] defined Graphoidal cover as partition of edge set of a graph G into internally disjoint paths (not necessarily open). The minimum cardinality of such cover is known as graphoidal covering number of G.

Info:

Periodical:

Bulletin of Mathematical Sciences and Applications (Volume 9)

Pages:

33-44

DOI:

https://doi.org/10.18052/www.scipress.com/BMSA.9.33

Citation:

A. N. Murugan, "Magic Graphoidal on Class of Trees", Bulletin of Mathematical Sciences and Applications, Vol. 9, pp. 33-44, 2014

Online since:

August 2014

Authors:

A. Nellai Murugan

Keywords:

Graphoidal Constant, Graphoidal Cover, Magic Graphoidal

Export:

RIS, BibTeX, Text

Distribution:

Open Access

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

References:

B.D. Acarya and E. Sampath Kumar, Graphoidal covers and Graphoidal covering number of a Graph, Indian J. Pure Appl. Math. 18(10). (1987). 882-890.

J.A. Gallian, A Dynamic Survey of graph labeling, The Electronic journal of Coimbinotorics 6 (2001) # DS6.

F. Harary, Graph Theory, Addition - Wesley publishing company Inc, USA, (1969).

A. Nellai Murugan, Magic graphoidal on Sm, n Outreach, A Multidisciplinary Refreed Journal , Vol. 4 (2011-12), 75-78.

A. Nellai Murugan and A. Nagarajan, Magic Graphoidal on Special type of Unicyclic Graphs, Scientia Magna, Vol. 7, (2011), No. 1, 99-105.

A. Nellai Murugan and A. Nagarajan Magic graphidal of path related graphs Advance Journal of Physical sciences, Access International Journals, Vol 1(2) pp.14-25, December (2012).

A. Nellai Murugan, Magic graphiadal on join of two graphs, International Journal of mathematical combinatorics. Vol 4(2012), 103-115.

A. Nellai Murugan, Magic graphiadal on product graphs, International journal of innovative research & development Vol 1(8), 2012, 44-53.

C. Packiam and S. Arumugam, On the Graphoidal covering number of a Graph. Indian J. Pure Appl. Math. 20 (1989), 330-333.

Show More Hide

Cited By:

[1] A. Kelarev, W. Susilo, M. Miller, J. Ryan, "Ideals of Largest Weight in Constructions Based on Directed Graphs", Bulletin of Mathematical Sciences and Applications, Vol. 15, p. 8, 2016

DOI: https://doi.org/10.18052/www.scipress.com/BMSA.15.8