On extremal cacti with respect to the Szeged index

DOI10.1016/j.amc.2017.03.036zbMath1411.05142OpenAlexW2607064319MaRDI QIDQ1738101

Shujing Wang

Publication date: 29 March 2019

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2017.03.036

zbMATH Keywords

Szeged indexcactuspendant vertex

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Applications of graph theory (05C90) Distance in graphs (05C12) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)

Related Items (13)

On extremal cacti with respect to the edge Szeged index and edge-vertex 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 ⋮ Minimum Szeged index among unicyclic graphs with perfect matchings ⋮ A lower bound of revised Szeged index of bicyclic graphs ⋮ Extremal results for cacti ⋮ Maximum Balaban index and sum-Balaban index of cacti ⋮ On the edge-Szeged index of unicyclic graphs with perfect matchings ⋮ On the general position number of two classes of graphs ⋮ Unnamed Item ⋮ On the edge-Szeged index of unicyclic graphs with given diameter ⋮ On cacti with large Mostar index

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the further relation between the (revised) Szeged index and the Wiener index of graphs
• Tricyclic graphs with maximal revised Szeged index
• 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 the variable Wiener indices of trees with given maximum degree
• On the differences between Szeged and Wiener indices of graphs
• Bounds for the sum-Balaban index and (revised) Szeged index of regular graphs
• On a conjecture about the Szeged index
• The \((n,n)\)-graphs with the first three extremal Wiener indices
• On ordinary and reverse Wiener indices of non-caterpillars
• Graphs whose Szeged and Wiener numbers differ by 4 and 5
• Wiener index versus Szeged index in networks
• The (revised) Szeged index and the Wiener index of a nonbipartite graph
• Improved bounds on the difference between the Szeged index and the Wiener index of graphs
• Bicyclic graphs with maximal revised Szeged index
• On the sum of all distances in bipartite graphs
• Edge-contributions of some topological indices and arboreality of molecular graphs
• Revised and edge revised Szeged indices of graphs
• The Maximum Wiener Index of Trees with Given Degree Sequences
• Wiener index of trees: Theory and applications

This page was built for publication: On extremal cacti with respect to the Szeged index