Sharp bounds on the zeroth-order general randić indices of conjugated bicyclic graphs
From MaRDI portal
Publication:636488
DOI10.1016/j.mcm.2011.01.030zbMath1219.05045OpenAlexW2084063391MaRDI QIDQ636488
Publication date: 28 August 2011
Published in: Mathematical and Computer Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.mcm.2011.01.030
Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75) Vertex degrees (05C07)
Related Items (3)
Sandwiching the (generalized) Randić index ⋮ Conjugated tricyclic graphs with the maximum zeroth-order general Randić index ⋮ The zeroth-order general Randic index of graphs with a given clique number
Cites Work
- Sharp bounds for the Zagreb indices of bicyclic graphs with \(k\)-pendant vertices
- On the maximum and minimum Zagreb indices of graphs with connectivity at most \(k\)
- Connected \((n,m)\)-graphs with minimum and maximum zeroth-order general Randić index
- On zeroth-order general Randić index of conjugated unicyclic graphs
- On the extremal Zagreb indices of graphs with cut edges
- On the maximum Zagreb indices of graphs with \(k\) cut vertices
- On unicycle graphs with maximum and minimum zeroth-order general Randić index
- Extremal graphs for weights
- Bounds on the largest eigenvalues of trees with a given size of matching
- Extremal \((n,n + 1)\)-graphs with respected to zeroth-order general Randić index
- Randić ordering of chemical trees
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Sharp bounds on the zeroth-order general randić indices of conjugated bicyclic graphs