Author:
ALI AKBAR, ,BALACHANDRAN SELVARAJ,ELUMALAI SURESH, ,
Abstract
"The general Randi´c index of a graph G is defined as Rα(G) = P uv∈E(G)(dudv)α, where du and dv denote the degrees of the vertices u and v, respectively, α is a real number, and E(G) is the edge set of G. The minimum number of edges of a graph G whose removal makes G as acyclic is known as the cyclomatic number and it is usually denoted by ν. A graph with the maximum degree at most 4 is known as a chemical graph. For ν = 0, 1, 2 and α > 1, the problem of finding graph(s) with the minimum general Randi´c index Rα among all n-vertex chemical graphs with the cyclomatic number ν has already been solved. In this paper, this problem is solved for the case when ν ≥ 3, n ≥ 5(ν − 1), and 1 < α < α0, where α0 ≈ 11.4496 is the unique positive root of the equation 4(8α − 6α) + 4α − 9α = 0."
Reference34 articles.
1. "[1] A. Ali, D. Dimitrov, Z. Du, and F. Ishfaq, On the extremal graphs for general sumconnectivity index (χα) with given cyclomatic number when α > 1. Discrete Appl. Math. 257 (2019), 19-30."
2. [2] B. Bollob'as and P. Erd˝os, Graphs of extremal weights. Ars Combin. 50 (1998), 225-233.
3. "[3] B. Borovi'canin and B. Furtula, On extremal Zagreb indices of trees with given domination number. Appl. Math. Comput. 279 (2016), 208-218."
4. "[4] G. Caporossi, P. Hansen, and D. Vukiˇcevi'c, Comparing Zagreb indices of cyclic graphs. MATCH Commun. Math. Comput. Chem. 63 (2010), 441-451."
5. "[5] M. Cavers, S. Fallat, and S. Kirkland, On the normalized Laplacian energy and general Randi'c index R−1 of graphs. Linear Algebra Appl. 433 (2010), 172-190."
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Note on the Minimum Bond Incident Degree Indices of k-Cyclic Graphs;Match - Communications in Mathematical and in Computer Chemistry;2023-10