Randić Index of a Graph with Self-Loops
Download PDF
Authors: H. A, S. D’SOUZA AND P. G. BHAT
DOI: 10.46793/KgJMat2605.759H
Abstract:
Let G(n,m) be a simple graph with vertex set V and S ⊆ V with |S| = σ. The graph GS is obtained by adding a self-loop to each vertex of the graph G in the set S. The Randić index of a graph is one of the important topological indices which has its application in chemistry. In this manuscript, the Randić index of a graph with self-loops is defined and are obtained some bounds for the same.
Keywords:
Graph with self-loops, topological index, degree of a vertex.
References:
[1] M. Randić, The connectivity index 25 years after, Journal of Molecular Graphics and Modelling 20 (2001), 19–35.
[2] M. Randić, On history of the Randić index and emerging hostility toward chemical graph theory, MATCH Commun. Math. Comput. Chem. 59 (2008), 5–124.
[3] X. Li and Y. Shi, A survey on the Randić index, MATCH Commun. Math. Comput. Chem. 59 (2008), 127–156.
[4] I. Gutman, B. Furtula and V. Katanić, Randić index and information, AKCE International Journal of Graphs and Combinatorics 15 (2018), 307–312.
[5] C. Dalfó, On the Randić index of graphs, Discrete Math. 342 (2019), 2792–2796.
[6] D. B. West, Introduction to Graph Theory, Vol. 2, Prentice hall Upper Saddle River, 2001.
[7] G. Chartrand and Z. Ping, A First Course in Graph Theory, Courier Corporation, 2013.
Login:
