On the edge-Szeged index of unicyclic graphs with perfect matchings
From MaRDI portal
Publication:777383
DOI10.1016/j.dam.2020.03.033zbMath1443.05041OpenAlexW3016144517MaRDI QIDQ777383
Shengjie He, Rong-xia Hao, Yan Quan Feng
Publication date: 7 July 2020
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2020.03.033
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09)
Cites Work
- Bounds for the sum-Balaban index and (revised) Szeged index of regular graphs
- On a conjecture about the Szeged index
- A matrix method for computing Szeged and vertex PI indices of join and composition of graphs
- The edge-Wiener index of a graph
- On extremal cacti with respect to the Szeged index
- On the Szeged index of unicyclic graphs with given diameter
- Minimum Szeged index among unicyclic graphs with perfect matchings
- The (revised) Szeged index and the Wiener index of a nonbipartite graph
- Relationship between edge Szeged and edge Wiener indices of graphs
- The Maximum Wiener Index of Trees with Given Degree Sequences
- On extremal cacti with respect to the edge Szeged index and edge-vertex Szeged index
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On the edge-Szeged index of unicyclic graphs with perfect matchings