On characterization of connected graphs without induced subgraphs - paws
Keywords:
undireceted graphs, connected graphs, induced subgraphs, graphs without 3-paws
Abstract
For the vertices of the graph , denoted the subgraph on the set of all vertices adjeceent with will be write as this subgraph is called a neighborhood of the vertex in the graph . In this work we investigates several properties of these connected graphs without induced subgraphs-paws.
Downloads
Download data is not yet available.
References
[1] Al’ Dzhabri Kh.Sh., Rodionov V.I., The graph of partial orders. Vestn. Udmurt. Univ. Mat. Mekh. Komp’yut. Nauki. 4 (2013) 3-12.
[2] Al’ Dzhabri Kh.Sh., The graph of reflexive-transitive relations and the graph of finite topologies. Vestn. Udmurt. Univ. Mat. Mekh. Komp’yut. Nauki. 1 (2015) 3-11.
[3] Al’ Dzhabri Kh.Sh., On subgraphs of graph of binary relations // Groups and Graphs, Algorithms and Automata: Abstacat of the international conference and PhD summer School in honor of the 80th Birthday of professor Vitaly A.Baranasky /Ural Federal University, Institute of Mathematics and Mechanics UB RAS, Institute of Mathematics SB RAS. Yekaterinburg, 2015. P. 30.
[4] Brouwer A.E., Numata M., A characterization of some graphs which do not contain 3-claws / / Discrete Math. 1994. Vol. 124. P.49-54.
[5]Diestel, Reinhard (2006),Graph Theory, Graduate texts in mathematics, 173, Springer-Verlag, pp. 3–4,ISBN9783540261834.
[6] Hamelink, Ronald C. (1968). ,A partial characterization of clique graphs. Journal of Combinatorial Theory. 5: 192–197.
[7]Numata М. , On a characterization of a class of regular graphs of diameter 2 // Osaka J. Math. 1974. Vol.11. P.389-400.
[8]V. I. Kazarina and A. A. Makhnev, On locally GQ(s, t) graphs with strongly regular μ-subgraphs St. Petersburg Math. J. Vol. 17 (2006), No. 3, Pages 443–452.
[9] Ore. O. ,Theory of graphs, Providence: Amer. Math. Soc. Colloq. Publ. 1962, vol.18, 270p. Translated under the title Teoriya grafov, Moscow: Nauka, 198, 336p.
[2] Al’ Dzhabri Kh.Sh., The graph of reflexive-transitive relations and the graph of finite topologies. Vestn. Udmurt. Univ. Mat. Mekh. Komp’yut. Nauki. 1 (2015) 3-11.
[3] Al’ Dzhabri Kh.Sh., On subgraphs of graph of binary relations // Groups and Graphs, Algorithms and Automata: Abstacat of the international conference and PhD summer School in honor of the 80th Birthday of professor Vitaly A.Baranasky /Ural Federal University, Institute of Mathematics and Mechanics UB RAS, Institute of Mathematics SB RAS. Yekaterinburg, 2015. P. 30.
[4] Brouwer A.E., Numata M., A characterization of some graphs which do not contain 3-claws / / Discrete Math. 1994. Vol. 124. P.49-54.
[5]Diestel, Reinhard (2006),Graph Theory, Graduate texts in mathematics, 173, Springer-Verlag, pp. 3–4,ISBN9783540261834.
[6] Hamelink, Ronald C. (1968). ,A partial characterization of clique graphs. Journal of Combinatorial Theory. 5: 192–197.
[7]Numata М. , On a characterization of a class of regular graphs of diameter 2 // Osaka J. Math. 1974. Vol.11. P.389-400.
[8]V. I. Kazarina and A. A. Makhnev, On locally GQ(s, t) graphs with strongly regular μ-subgraphs St. Petersburg Math. J. Vol. 17 (2006), No. 3, Pages 443–452.
[9] Ore. O. ,Theory of graphs, Providence: Amer. Math. Soc. Colloq. Publ. 1962, vol.18, 270p. Translated under the title Teoriya grafov, Moscow: Nauka, 198, 336p.
Published
2018-01-09
How to Cite
Khairalla Al’ DzhabriK. S. (2018). On characterization of connected graphs without induced subgraphs - paws. Al-Qadisiyah Journal of Pure Science, 22(2), 135-142. Retrieved from https://journalsc.qu.edu.iq/index.php/JOPS/article/view/563
Issue
Section
Articles
Copyright © Author(s) . This is an open access article distributed under the Creative Commons Attribution
License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly
cited.
