On \textit{EAZ} index of unicyclic and bicyclic graphs, general graphs in terms of the number of cut edges
From MaRDI portal
Publication:6586114
DOI10.1007/S12190-024-02086-4zbMATH Open1542.05085MaRDI QIDQ6586114
Publication date: 12 August 2024
Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)
Extremal problems in graph theory (05C35) Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09) Chemical graph theory (05C92)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Augmented Zagreb index
- Unicyclic and bicyclic graphs with maximum exponential second Zagreb index
- On connected graphs having the maximum connective eccentricity index
- The augmented Zagreb index, vertex connectivity and matching number of graphs
- Open problems on the exponential vertex-degree-based topological indices of graphs
- Maximal augmented Zagreb index of trees with given diameter
- Exponential topological indices: optimal inequalities and applications
- On graphs with integer Sombor index
- On the Sanskruti index of graphs
- More on the linearization of \(W\) algebras.
- The exponential second Zagreb index of \((n, m)\)-graphs
- Smallest ABS index of unicyclic graphs with given girth
- On the exponential augmented Zagreb index of graphs
- Exploring the SDE index: a novel approach using eccentricity in graph analysis
Related Items (1)
This page was built for publication: On \textit{EAZ} index of unicyclic and bicyclic graphs, general graphs in terms of the number of cut edges
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6586114)