Abstract
An induced acyclic graphoidal decomposition (IAGD) of a graph G is a collection ψ of nontrivial induced paths in G such that every edge of G lies in exactly one path of ψ and no two paths in ψ have a common internal vertex. The minimum cardinality of an IAGD of G is called the induced acyclic graphoidal decomposition number denoted by η ia(G). In this paper we present bounds for η ia(G) in terms of cut vertices and simplicial vertices of G.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Acharya, B. D., Sampathkumar, E.: Graphoidal covers and graphoidal covering number of a graph. Indian J.pure appl.Math. 18(10), 882–890 (1987)
Arumugam, S.: Path covers in graphs. Lecture Notes of the National Workshop on Decompositions of Graphs and Product Graphs held at Annamalai University, Tamil Nadu, during January 3–7, (2006)
Arumugam, S., Hamid, I. S.: Simple graphoidal covers in graphs. J. Combin. Math. Combin. Comput. 64, 79–95 (2008)
Arumugam, S and Suseela, J. S.: Acyclic graphoidal covers and path partitions in a graph, Discrete Mathematics, 190, 67–77 (1998)
Harary, F.: Covering and packing in graphs I. Ann. N. Y. Acad. Sci. 175, 198–205 (1970)
Peroche, B.: The path number of some multipartite graphs. Annals of Discrete Math. 9, 195–197 (1980)
Singh, K. R., Das, P. K.: Induced acyclic graphoidal covers in a graph. World Academy of Science, Engineering and Technology. 68, 38–44 (2010)
Hamid, I. S., Joseph, M.: Further results on induced graphoidal decomposition. Discrete Mathematics, Algorithms and Applications.5(1) (2013) https://doi.org/10.1142/S1793830913500067
Hamid, I. S., Joseph, M: Decomposing graphs into internally-disjoint induced paths. SCIENTIA. Series A: Mathematical Sciences. 27 47–57(2016)
Stanton, R. G., Cowan, D. D., James, L.O.: Some results on path numbers. Proc. Louisiana Conf. on Combinatorics.Graph Theory and Computing, 112–135 (1970)
West, D. B.: Introduction to Graph Theory, Second Edition. Prentice Hall of India, New Delhi (2005)
Whitney,H.: Congruent graphs and the connectivity of graphs, Amer. J. Math 54, 150–168 (1932)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Joseph, M., Sahul Hamid, I. (2019). New Bounds of Induced Acyclic Graphoidal Decomposition Number of a Graph. In: Rushi Kumar, B., Sivaraj, R., Prasad, B., Nalliah, M., Reddy, A. (eds) Applied Mathematics and Scientific Computing. Trends in Mathematics. Birkhäuser, Cham. https://doi.org/10.1007/978-3-030-01123-9_59
Download citation
DOI: https://doi.org/10.1007/978-3-030-01123-9_59
Published:
Publisher Name: Birkhäuser, Cham
Print ISBN: 978-3-030-01122-2
Online ISBN: 978-3-030-01123-9
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)