Status Connectivity Indices of Middle graph

Authors

  • Roopa Subhas Naikar Karnatak University's Karnatak Arts College Dharwad.

DOI:

https://doi.org/10.23755/rm.v51i0.1471

Keywords:

Middle graph, Status connectivity indices, Sunlet graph, Tree.

Abstract

Topological index is sometimes also known as graph theoretic index, is a numerical invariant of a graph, the topological indices are classified on degree and distance based concepts. The status σ(u) of a vertex u ∈ V (G) is defined as the sum of its distances between each other vertex in V(G) of the graph G. Ramane and Yalnaik defined the distance based topological indices such as first and second status connectivity indices. In this article bounds for the first and second status connectivity indices of middle graph of a graph are established and further status connectivity indices of middle graph of certain graphs are computed.

References

Gutman, I., and Trinajstić, N., (1972), "Graph Theory and Molecular Orbitals: Total π−electron energy of alternant hydrocarbons," Chem. Phys. Lett., 17(4), 535-538.

Hamada, T., and Yoshimura, I., (1976), "Traversability and Connectivity of the Middle Graph of a Graph," Discrete Math., 14, 247–255.

Gallian, J. A., (2007), "A Dynamic Survey of Graph Labeling," Electron Journal of Combin., U.S.A.

Harary, F., (1959), "Status and Contrastatus," Sociometry, 22, 23–43.

Harary, F., (1969), "Graph Theory," Addison–Wesley, Reading, Mass, U.S.A.

Jummannaver, R. B., Gutman, I., and Mundewadi, R. A., (2018), "On Zagreb Indices and Coindices of Cluster Graphs," Bulletin of IMVI., 8, 477–485.

Kahsay, A. T., and Narayankar, K. P., (2018), "Status Coindex Distance Sums," Indian J. Discrete Math., 4(1), 27-46.

Kazemnejad, F., Pahlavsay, B., Palezzato, E., and Torielli, M., (2017), "Domination Number of Middle Graphs," J. Appl. Math. Comput., 55, 609–627.

Ramane, H. S., Narayankar, K. P., Shirkol, S. S., and Ganagi, A. B., (2013), "Terminal Wiener Index of Line Graphs," MATCH Commun. Math. Comput. Chem., 69, 775–782.

Ramane, H. S., and Talwar, S. Y., (2021), "Status Connectivity Indices of Line Graph," Afrika Matematika, 32, 1615–1627.

Ramane, H. S., and Yalnaik, A. S., (2017), "Status Connectivity Indices of Graphs and Its Applications to the Boiling Point of Benzenoid Hydrocarbons," J. Appl. Math. Comput., 55, 609–627.

Ramane, H. S., Yalnaik, A. S., and Sharafdini, R., (2020), "Status Connectivity Indices and Co-indices of Graphs and Its Computation to Some Distance-Balanced Graphs," AKCE Int. J. Graphs Comb., 17(1), 98–108.

Shobana, A., and Logapriya, B., (2018), "Domination Number of n-Sunlet Graph," Int. J. Pure. Appl. Math., 118(20), 1149-1152.

Wiener, H., (1947), "Structural Determination of Paraffin Boiling Points," J. Am. Chem. Soc., 69(1), 17-20.

Downloads

Published

2024-01-31

Issue

Vol. 51 (2024)

Section

Volume 51-2024

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.