Trees of extremal connectivity index

DOI10.1016/J.DAM.2004.10.009MaRDI QIDQ2581562zbMATH OpenOpenAlexFDO

Authors Huiqing Liu, Mei Lu, Feng Tian

Publication date 10 January 2006

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

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

zbMATH Keywords

Randić index

Mathematics Subject Classification ID

Trees (05C05)

Review text

Let \(d(x)\) denote the degree of node \(x\) in a graph \(G\) and let \(\alpha\) be a non-zero constant. The connectivity index, or Randić index, \(w_\alpha(G)\) of a graph \(G\) is the sum of \((d(u)d(v))^\alpha\) over all edges \(uv\) of \(G\). Let \(T\) be a tree with \(n\) nodes and \(k\) end-nodes. The authors give sharp upper and lower bounds for \(w_\alpha(T)\) when \(\alpha = 1\); and a sharp lower bound and an upper bound when \(-1 \leq\alpha < 0\).

Recommendations

• On the extremal connectivity index of trees with k pendant vertices
• scientific article; zbMATH DE number 2239310
• Sharp lower bounds on the sum-connectivity index of trees
• The generalized Randić index of trees
• On general sum-connectivity index of trees of fixed maximum degree and order

Cites work

• Graphs of extremal weights
• scientific article; zbMATH DE number 2128965 (Why is no real title available?)
• scientific article; zbMATH DE number 1262188 (Why is no real title available?)
• scientific article; zbMATH DE number 1792579 (Why is no real title available?)
• scientific article; zbMATH DE number 6123974 (Why is no real title available?)
• The connectivity index
• Trees with the first three smallest and largest generalized topological indices
• Variable neighborhood search for extremal graphs. V: Three ways to automate finding conjectures

Cited in

(29)

• Maximum Randić index on trees with k-pendant vertices
• Conjugated trees with minimum general Randić index
• The maximum Randić index of chemical trees with \(k\) pendants
• Higher order connectivity index of starlike trees
• The general Randić index of trees with given number of pendent vertices
• A note on extremal trees with degree conditions
• Survey on the general Randić index: extremal results and bounds
• Extremal results for directed tree connectivity
• Extremum modified first Zagreb connection index of \(n\)-vertex trees with fixed number of pendent vertices
• On structural properties of ABC-minimal chemical trees
• The starlike trees with maximum and minimum second order connectivity index
• scientific article; zbMATH DE number 4065011 (Why is no real title available?)
• Functions on adjacent vertex degrees of trees with given degree sequence
• Sharp upper bounds on Zagreb indices of bicyclic graphs with a given matching number
• scientific article; zbMATH DE number 1057879 (Why is no real title available?)
• scientific article; zbMATH DE number 6863758 (Why is no real title available?)
• On the extremal connectivity index of trees with k pendant vertices
• scientific article; zbMATH DE number 6123974 (Why is no real title available?)
• General Randić index of unicyclic graphs with given number of pendant vertices
• Sharp bounds for the Zagreb indices of bicyclic graphs with \(k\)-pendant vertices
• Sharp upper bounds for Zagreb indices of bipartite graphs with a given diameter
• General Randić index of trees with given number of branching vertices
• A complete solution for maximizing the general Sombor index of chemical trees with given number of pendant vertices
• On the maximum and minimum Zagreb indices of graphs with connectivity at most \(k\)
• Sharp bounds for Zagreb indices of maximal outerplanar graphs
• Extremal trees with given degree sequence for the Randić index
• On the connectivity index of trees
• On the extremal Zagreb indices of graphs with cut edges
• On the maximum Zagreb indices of graphs with \(k\) cut vertices

This page was built for publication: Trees of extremal connectivity index

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2581562)