Skip to main content
Top

2019 | OriginalPaper | Chapter

New Bounds of Induced Acyclic Graphoidal Decomposition Number of a Graph

Authors : Mayamma Joseph, I. Sahul Hamid

Published in: Applied Mathematics and Scientific Computing

Publisher: Springer International Publishing

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

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.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literature
1.
go back to reference Acharya, B. D., Sampathkumar, E.: Graphoidal covers and graphoidal covering number of a graph. Indian J.pure appl.Math. 18(10), 882–890 (1987) Acharya, B. D., Sampathkumar, E.: Graphoidal covers and graphoidal covering number of a graph. Indian J.pure appl.Math. 18(10), 882–890 (1987)
2.
go back to reference 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.: 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)
3.
go back to reference Arumugam, S., Hamid, I. S.: Simple graphoidal covers in graphs. J. Combin. Math. Combin. Comput. 64, 79–95 (2008)MathSciNetMATH Arumugam, S., Hamid, I. S.: Simple graphoidal covers in graphs. J. Combin. Math. Combin. Comput. 64, 79–95 (2008)MathSciNetMATH
4.
go back to reference Arumugam, S and Suseela, J. S.: Acyclic graphoidal covers and path partitions in a graph, Discrete Mathematics, 190, 67–77 (1998)MathSciNetCrossRef Arumugam, S and Suseela, J. S.: Acyclic graphoidal covers and path partitions in a graph, Discrete Mathematics, 190, 67–77 (1998)MathSciNetCrossRef
7.
go back to reference Singh, K. R., Das, P. K.: Induced acyclic graphoidal covers in a graph. World Academy of Science, Engineering and Technology. 68, 38–44 (2010) Singh, K. R., Das, P. K.: Induced acyclic graphoidal covers in a graph. World Academy of Science, Engineering and Technology. 68, 38–44 (2010)
9.
go back to reference Hamid, I. S., Joseph, M: Decomposing graphs into internally-disjoint induced paths. SCIENTIA. Series A: Mathematical Sciences. 27 47–57(2016) Hamid, I. S., Joseph, M: Decomposing graphs into internally-disjoint induced paths. SCIENTIA. Series A: Mathematical Sciences. 27 47–57(2016)
10.
go back to reference 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) 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)
11.
go back to reference West, D. B.: Introduction to Graph Theory, Second Edition. Prentice Hall of India, New Delhi (2005)MATH West, D. B.: Introduction to Graph Theory, Second Edition. Prentice Hall of India, New Delhi (2005)MATH
Metadata
Title
New Bounds of Induced Acyclic Graphoidal Decomposition Number of a Graph
Authors
Mayamma Joseph
I. Sahul Hamid
Copyright Year
2019
DOI
https://doi.org/10.1007/978-3-030-01123-9_59

Premium Partner