Monophonic graphoidal covering number of corona product graphs
DOI:
https://doi.org/10.22199/issn.0717-6279-4781Keywords:
graphoidal cover, monophonic path, monophonic graphoidal cover, monophonic graphoidal covering numberAbstract
In a graph G, a chordless path is called a monophonic path. A collection ψm of monophonic paths in G is called a monophonic graphoidal cover of G if every vertex of G is an internal vertex of at most one monophonic path in ψm and every edge of G is in exactly one monophonic path in ψm. The monophonic graphoidal covering number ηm(G) of G is the minimum cardinality of a monophonic graphoidal cover of G. In this paper, we find the monophonic graphoidal covering number of corona product of some standard graphs.
Downloads
References
B. D. Acharya, "Further results on the graphoidal covering number of a graph", Graph Theory News Letter, vol. 17, no. 4, pp. 1, 1988.
B. D. Acharya and E. Sampathkumar, “Graphoidal covers and graphoidal covering number of a graph”, Indian Journal of Pure and Applied Mathematics, vol. 18, no. 10, pp. 882-890, 1987.
S. Arumugam and C. Pakkiam, “Graphs with unique mínimum graphoidal cover”, Indian Journal of Pure and Applied Mathematics, vol. 25, no. 11, pp. 1147-1153, 1994.
S. Arumugam and J. Suresh Suseela, “Acyclic graphoidal covers and path partitions in a graph”, Discrete Mathematics, vol. 190, pp. 67-77, 1998. https://doi.org/10.1016/s0012-365x(98)00032-6
S. Arumugam and J. Suresh Suseela, “Geodesic graphoidal covering number of a graph”, The Journal of the Indian Mathematical Society, vol. 72, nos. 1-4, pp. 99-106, 2005.
F. Harary, Graph Theory. Addison - Wesley, Reading Mass, 1969.
C. Pakkiam and S. Arumugam, “On the graphoidal covering number of a graph”, Indian Journal of Pure and Applied Mathematics, vol. 20, no. 4, pp. 330-333, 1989.
C. Pakkiam and S. Arumugam, “The graphoidal covering number of unicyclic graphs”, Indian Journal of Pure and Applied Mathematics, vol. 23, no. 2, pp. 141-143, 1992.
K. R. Singh and P.K. Das, “On graphoidal covers of bicyclic graphs”, International Mathematical Forum, vol. 5, no. 42, pp. 2093-2101, 2010.
A.P. Santhakumaran and P. Titus, “Monophonic distance in graphs”, Discrete Mathematics, Algorithms and Applications, vol. 3, no. 2, pp. 159-169, 2011. https://doi.org/10.1142/s1793830911001176
A.P. Santhakumaran and P. Titus, “A note on ‘Monophonic distance in graphs”, Discrete Mathematics, Algorithms and Applications, vol. 4, no. 2, 2012. https://doi.org/10.1142/S1793830912500188.
P. Titus and S. Santha Kumari, “The monophonic graphoidal covering number of a graph”, International Journal of Pure and Applied Mathematics, vol. 96, no. 1, pp. 37-45, 2014. https://doi.org/10.12732/ijpam.v96i1.4
P. Titus and S. Santha Kumari, “Monophonic Graphoidal Covering Number of a Bicyclic Graph”, Communicated.
Downloads
Published
Issue
Section
License
Copyright (c) 2023 P. Titus, M. Subha, S. Santha Kumari
This work is licensed under a Creative Commons Attribution 4.0 International License.
-
Attribution — You must give appropriate credit, provide a link to the license, and indicate if changes were made. You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
- No additional restrictions — You may not apply legal terms or technological measures that legally restrict others from doing anything the license permits.
