Omega invariant of the line graphs of tricyclic

Hacer Özden Ayna

Öz


Graphs are probably one of the few fastest growing subjects due to their applications in many areas including Chemistry, Physics, Biology, Anthropology, Finance, Social Sciences, etc. One of the ways of classifying graphs is according to the number of faces. A graph having no cycle is called acyclic, and a graph having one, two, three, faces are respectively called unicyclic, bicyclic, tricyclic. Recently, a new graph invariant denoted by Ω(D) for a realizable degree sequence D is defined. Ω(D) gives a list of information on the realizability, number of faces, components, chords, multiple edges, loops, pendant edges, bridges, cyclicness, connectedness, etc. of the realizations of D and is shown to have several explicit applications in Graph Theory. Acyclic, unicyclic and bicyclic graphs have been studied already in relation with Ω invariant. In this paper, we study tricyclic graphs by means of Ω invariant.


Tam Metin:

PDF

Referanslar


Bondy, J.A. and Murty, U.S.R., Graph Theory, Springer NY, (2008).

Delen, S. and Cangul, I.N., A new graph invariant, Turkish Journal of Analysis and Number Theory, 6(1), 30-33, (2018).

Diestel, R., Graph Theory, Springer GTM, (2010).

Foulds, L.R., Graph Theory Applications, Springer Universitext, (1992).

Ozden Ayna, H., Ersoy Zihni, F., Erdogan, Ozen, F., Cangul, I. N., Srivastava, G. and Srivastava, H. M., Independence number of graphs and line graphs of trees by means of omega invariant, (preprint).

Ozden Ayna, H., Togan, M., Yurttas, A. and Cangul, I.N., Independence number of the line graphs caterpillar trees, (preprint).

Wallis, W.D., A Beginner's Guide to Graph Theory, Birkhauser, Boston, (2007).

West, W.D., Introduction to Graph Theory, Pearson, India, (2001).


Refback'ler

  • Şu halde refbacks yoktur.


Telif Hakkı (c) 2019 Hacer Özden Ayna

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