On variable sum exdeg indices of quasi-tree graphs and unicyclic graphs
From MaRDI portal
Publication:2004157
Summary: In this work, by using the properties of the variable sum exdeg indices and analyzing the structure of the quasi-tree graphs and unicyclic graphs, the minimum and maximum variable sum exdeg indices of quasi-tree graphs and quasi-tree graphs with perfect matchings were presented; the minimum and maximum variable sum exdeg indices of unicyclic graphs with given pendant vertices and cycle length were determined.
Recommendations
Cites work
- Computing the eccentric connectivity index and eccentric adjacency index of conjugated trees
- Eccentric adjacency index of graphs with a given number of cut edges
- Extremal graphs with respect to variable sum exdeg index via majorization
- Graph theory with applications
- The eccentric adjacency index of unicyclic graphs and trees
Cited in
(8)- Some vertex/edge-degree-based topological indices of \(r\)-apex trees
- Some bond incident degree indices of (molecular) graphs with fixed order and number of cut vertices
- On the graph connectivity and the variable sum exdeg index
- On the extremal cactus graphs for variable sum exdeg index with a fixed number of cycles
- On the variable sum exdeg index and cut edges of graphs
- On the variable sum exdeg index/coindex of graphs
- A note on the variable sum exdeg index/coindex of trees
- On variable sum exdeg energy of graphs
This page was built for publication: On variable sum exdeg indices of quasi-tree graphs and unicyclic graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2004157)
