Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/de-gruyter/extremal-trees-for-the-randi-index-e4Kfbbmzsr
References (13)
-
Y. Shang (2012)
Distinct Clusterings and Characteristic Path Lengths in Dynamic Small-World Networks with Identical Limit Degree DistributionJournal of Statistical Physics, 149
-
G. Caporossi, I. Gutman, P. Hansen (1999)
Variable Neighborhood Search for Extremal Graphs: IV: Chemical Trees with Extremal Connectivity IndexComput. Chem., 23
-
Y. Shang (2012)
Mean Commute Time for Random Walks on Hierarchical Scale-Free NetworksInternet Mathematics, 8
-
Zhongzhi Zhang, Hongxiao Liu, Bin Wu, Tao Zou (2011)
Spanning trees in a fractal scale-free lattice.Physical review. E, Statistical, nonlinear, and soft matter physics, 83 1 Pt 2
-
Mei Lu, Jinwu Gao (2007)
On the Randić Index of Quasi-tree GraphsJournal of Mathematical Chemistry, 42
-
M. Randic (1975)
Characterization of molecular branchingJournal of the American Chemical Society, 97
-
Zhongzhi Zhang, Bin Wu, Yuan Lin (2012)
Counting spanning trees in a small-world Farey graphPhysica A-statistical Mechanics and Its Applications, 391
-
H. Wiener (1947)
Structural determination of paraffin boiling points.Journal of the American Chemical Society, 69 1
-
R. Todeschini, V. Consonni (2009)
Molecular Descriptors for Chemoinformatics: Volume I: Alphabetical Listing / Volume II: Appendices, References -
S. Bermudo, J. Valdés, J. Rada (2020)
Extremal trees for the Randić index with given domination numberAppl. Math. Comput., 375
-
Y. Shang (2022)
Sombor index and degree-related properties of simplicial networksAppl. Math. Comput., 419
-
Y. Shang (2014)
Geometric Assortative Growth Model for Small-World NetworksThe Scientific World Journal, 2014
-
Xiaoling Sun, Yubin Gao, Jianwei Du (2019)
The harmonic index of two-trees and quasi-tree graphsJournal of Mathematical Inequalities
- Publisher
- de Gruyter
- Copyright
- © 2022 Akbar Jahanbani et al., published by Sciendo
- eISSN
- 2066-7752
- DOI
- 10.2478/ausm-2022-0016
- Publisher site
- See Article on Publisher Site
Abstract
AbstractGraph theory has applications in various fields due to offering important tools such as topological indices. Among the topological indices, the Randić index is simple and of great importance. The Randić index of a graph 𝒢 can be expressed as R(G)=∑xy∈Y(G)1τ(x)τ(y)R\left( G \right) = \sum\nolimits_{xy \in Y\left( G \right)} {{1 \over {\sqrt {\tau \left( x \right)\tau \left( y \right)} }}}, where 𝒴(𝒢) represents the edge set and τ(x) is the degree of vertex x. In this paper, considering the importance of the Randić index and applications two-trees graphs, we determine the first two minimums among the two-trees graphs.
Journal
Acta Universitatis Sapientiae, Mathematica – de Gruyter
Published: Dec 1, 2022
Keywords: Randić index; two-tree graphs; 05C07; 05C35