Tricyclic graphs with maximal revised Szeged index
From MaRDI portal
Publication:406325
DOI10.1016/j.dam.2014.05.034zbMath1297.05068arXiv1307.0192OpenAlexW3142850237MaRDI QIDQ406325
Lily Chen, Meng-Meng Liu, Xue Liang Li
Publication date: 8 September 2014
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1307.0192
Related Items
Bicyclic graphs with maximal edge revised Szeged index ⋮ Cactus graphs with minimum edge revised Szeged index ⋮ On extremal cacti with respect to the revised Szeged index ⋮ On minimum revised edge Szeged index of bicyclic graphs ⋮ Counting independent sets in tricyclic graphs ⋮ On extremal cacti with respect to the Szeged index ⋮ A lower bound of revised Szeged index of bicyclic graphs ⋮ On the revised Szeged index of unicyclic graphs with given diameter
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Use of the Szeged index and the revised Szeged index for measuring network bipartivity
- On the revised Szeged index
- Note on PI and Szeged indices
- On a conjecture about the Szeged index
- Szeged index, edge Szeged index, and semi-star trees
- Wiener index versus Szeged index in networks
- The (revised) Szeged index and the Wiener index of a nonbipartite graph
- Bicyclic graphs with maximal revised Szeged index
- Edge-contributions of some topological indices and arboreality of molecular graphs
- Wiener index of trees: Theory and applications