KCD indices and coindices of graphs

Authors

  • Keerthi G. Mirajkar Department of Mathematics, Karnatak University’s Karnatak Arts College, Dharwad - 580001, Karnataka, INDIA
  • Akshata Morajkar Department of Mathematics, Karnatak University’s Karnatak Arts College, Dharwad - 580001, Karnataka, INDIA

DOI:

https://doi.org/10.23755/rm.v39i0.550

Keywords:

KCD indices, KCD coindices, graph operations

Abstract

The relationship between vertices of a graph is always an interesting fact, but the relations of vertices and edges also seeks attention. Motivation of the relationship between vertices and edges of a graph has helped to arise with a set of new degree based topological indices and coindices named KCD indices and coindices. These indices and coindices are elaborated by establishing a set of properties. More fascinating results of some graph operations using KCD indices are developed in this article.

References

Anwar Alwardi, Akram Alqesmah, R Rangarajan, and Ismail Naci Cangul. Entire zagreb indices of graphs. Discrete Mathematics, Algorithms and Applications,10(03):1850037, 2018.

Ali Reza Ashrafi, Tomislav Doˇsli´c, and Asma Hamzeh. The zagreb coindices of graph operations. Discrete applied mathematics, 158(15):1571–1578, 2010.

Ali Reza Ashrafi, T Doˇslic, and Asma Hamzeh. Extremal graphs with respect to the zagreb coindices. MATCH Commun. Math. Comput. Chem, 65(1):85–92,2011.

Tomislav Doslic. Vertex-weighted wiener polynomials for composite graphs. Ars Mathematica Contemporanea, 1(1):66–80, 2008.

Tomislav Doslic, Boris Furtula, Ante Graovac, Ivan Gutman, Sirous Moradi, and Zahra Yarahmadi. On vertex–degree–based molecular structure descriptors. MATCH Commun. Math. Comput. Chem, 66(2):613–626, 2011.

I Gutman, B Horoldagva, et al. Comparing zagreb indices and coindices of trees.Match, 2012.

Ivan Gutman. On hyper–zagreb index and coindex. Bulletin (Acad´emie serbe des sciences et des arts. Classe des sciences math´ematiques et naturelles. Sciences math´ematiques), (42):1–8, 2017.

Ivan Gutman and Kinkar Ch Das. The first zagreb index 30 years after. MATCH Commun. Math. Comput. Chem, 50(1):83–92, 2004.

Ivan Gutman and Nenad Trinajsti´c. Graph theory and molecular orbitals. total'-electron energy of alternant hydrocarbons. Chemical Physics Letters, 17(4):535–538, 1972.

Ivan Gutman, Boris Furtula, Z Kovijanic Vukicevic, and Goran Popivoda. On zagreb indices and coindices. MATCH Commun. Math. Comput. Chem, 74(1):5–16, 2015.

Frank Harary. Graph theory. Addison–Wesely, Reading, Mass, 1969.

Wilfried Imrich and Sandi Klavzar. Product graphs: structure and recognition.Wiley, 2000.

MH Khalifeh, H Yousefi-Azari, and AR Ashrafi. A matrix method for computing szeged and vertex pi indices of join and composition of graphs. Linear algebra and its applications, 429(11-12):2702–2709, 2008a.

MH Khalifeh, Hassan Yousefi-Azari, and Ali Reza Ashrafi. Vertex and edge pi indices of cartesian product graphs. Discrete Applied Mathematics, 156(10):1780–1789, 2008b.

MH Khalifeh, Hassan Yousefi-Azari, and Ali Reza Ashrafi. The first and second zagreb indices of some graph operations. Discrete Applied Mathematics, 157(4):804–811, 2009.

K Pattabiraman and M Vijayaragavan. Hyper zagreb indices and its coindices of graphs. BULLETIN OF INTERNATIONAL MATHEMATICAL VIRTUAL INSTITUTE,7(1):31–41, 2017.

GH Shirdel, H Rezapour, and AM Sayadi. The hyper-zagreb index of graph operations. Iranian Journal of Mathematical Chemistry, 4(2):213–220, 2013.

Maryam Veylaki, Mohammad Javad Nikmehr, and Hamid Agha Tavallaee. The third and hyper-zagreb coindices of some graph operations. Journal of Applied Mathematics and Computing, 50(1-2):315–325, 2016.

Bo Zhou. Zagreb indices. MATCH-Communications in Mathematical and in Computer Chemistry, (52):113–118, 2004.

Bo Zhou and Ivan Gutman. Further properties of zagreb indices. MATCH Commun. Math. Comput. Chem, 54(1):233–239, 2005.

Downloads

Published

2020-12-30

Issue

Vol. 39 (2020)

Section

Volume 39-2020

License

This journal provides immediate open access to its content on the principle that making research freely available to the public supports a greater global exchange of knowledge. The journal is committed to real and immediate open access for academic work. All of the journal articles are free to access immediately from the date of publication. There are no charge for readers to download articles and reviews for their own scholarly use. Benefits of open access for authors, include:

  • Free access for all users worldwide
  • Increased visibility and readership
  • Rapid publication
  • No spatial constraints
  • Authors can share their research papers on their personal web-pages (i.e. ResearchGate, etc.)

Ratio Mathematica publishes open access articles under the terms of the Creative Commons Attribution (CC BY) License. The Creative Commons Attribution License (CC-BY) allows users to copy, distribute and transmit an article, adapt the article and make commercial use of the article. The CC BY license permits commercial and non-commercial re-use of an open access article, as long as the author is properly attributed. Copyright on any research article published by Ratio Mathematica is retained by the author(s). Authors grant Ratio Mathematica a license to publish the article and identify itself as the original publisher. Authors also grant any third party the right to use the article freely as long as its original authors, citation details and publisher are identified. 
For further information visit: https://creativecommons.org/licenses/by/3.0/. The following logo will appear in any paper that will be published from the volume number 31/2016 onwards.