Connected \((n,m)\)-graphs with minimum and maximum zeroth-order general Randić index

From MaRDI portal
Publication:881585

DOI10.1016/j.dam.2006.11.008zbMath1120.05046OpenAlexW2079538859MaRDI QIDQ881585

Xue Liang Li, Yumei Hu, Tianyi Xu, Yongtang Shi

Publication date: 30 May 2007

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2006.11.008




Related Items (36)

Inverse degree, Randic index and harmonic index of graphsEntropy of weighted graphs with Randić weightsGraphs with Minimum Vertex-Degree Function-Index for Convex FunctionsExtremal Problems for Graphical Function-Indices and f-Weighted Adjacency MatrixDegree-based entropies of networks revisitedInertia of complex unit gain graphsBounds for degree-based network entropiesNote on two generalizations of the Randić indexRelationship externalitiesSharp bounds on the zeroth-order general Randić index of unicyclic graphs with given diameterSymmetric Division Deg Index: Extremal Results and BoundsSharp bounds of the zeroth-order general Randić index of bicyclic graphs with given pendent vertices(n,m)-Graphs with Maximum Vertex–Degree Function–Index for Convex FunctionsSharp bounds on the zeroth-order general randić indices of conjugated bicyclic graphsSums of powers of the degrees of graphs with \(k\) cut edgesOn the extremal graphs for general sum-connectivity index \((\chi_{{}_\alpha})\) with given cyclomatic number when \(\alpha > 1\)On the zeroth-order general Randić index, variable sum exdeg index and trees having vertices with prescribed degreeOn the tree with diameter 4 and maximal energyThe reformulated Zagreb indices of tricyclic graphsThe bipartite unicyclic graphs with the first \(\lfloor \frac{n - 3}{4} \rfloor\) largest matching energiesBounds for the sum-Balaban index and (revised) Szeged index of regular graphsExtremal values of matching energies of one class of graphsThe Zagreb indices of four operations on graphsThe asymptotic value of the zeroth-order Randić index and sum-connectivity index for treesThe Zagreb indices of graphs based on four new operations related to the lexicographic productGraphs with fixed number of pendent vertices and minimal zeroth-order general Randić indexF index of graphs based on four new operations related to the strong productExtremality of degree-based graph entropiesMore on ``Connected \((n,m)\)-graphs with minimum and maximum zeroth-order general Randić indexConjugated tricyclic graphs with the maximum zeroth-order general Randić indexSufficient conditions on the zeroth-order general Randić index for maximally edge-connected graphsThe minimum degree distance of graphs of given order and sizeZeroth-order general Randić index of cactus graphsThe zeroth-order general Randic index of graphs with a given clique numberGeneralized degree-based graph entropiesSome extremal graphs with respect to inverse degree



Cites Work




This page was built for publication: Connected \((n,m)\)-graphs with minimum and maximum zeroth-order general Randić index