Tricyclic graphs with maximal revised Szeged index

DOI10.1016/J.DAM.2014.05.034MaRDI QIDQ406325zbMATH OpenOpenAlexFDO

Authors Lily Chen, Xueliang Li, Meng-Meng Liu

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

zbMATH Keywords

Wiener indexrevised Szeged indexSzeged indextricyclic graph

Mathematics Subject Classification ID

Vertex degrees (05C07) Distance in graphs (05C12)

Abstract: The revised Szeged index of a graph $G$ is defined as $S{z}^{\ast }(G)=su{m}_{e=uvinE}(n_u(e)+n_0(e)/2)(n_v(e)+n_0(e)/2),$ where $n_u(e)$ and $n_v(e)$ are, respectively, the number of vertices of $G$ lying closer to vertex $u$ than to vertex $v$ and the number of vertices of $G$ lying closer to vertex $v$ than to vertex $u$, and $n_0(e)$ is the number of vertices equidistant to $u$ and $v$. In this paper, we give an upper bound of the revised Szeged index for a connected tricyclic graph, and also characterize those graphs that achieve the upper bound.

Recommendations

• The lower bound of revised Szeged index with respect to tricyclic graphs
• A lower bound of revised Szeged index of bicyclic graphs
• Bicyclic graphs with maximal revised Szeged index
• Bicyclic graphs with maximal edge revised Szeged index
• On minimum revised edge Szeged index of bicyclic graphs

Cites work

• scientific article; zbMATH DE number 4074878 (Why is no real title available?)
• scientific article; zbMATH DE number 1052827 (Why is no real title available?)
• scientific article; zbMATH DE number 1548995 (Why is no real title available?)
• scientific article; zbMATH DE number 6282171 (Why is no real title available?)
• Bicyclic graphs with maximal revised Szeged index
• Edge-contributions of some topological indices and arboreality of molecular graphs
• Graph theory
• Note on PI and Szeged indices
• On a conjecture about the Szeged index
• On a relation between Szeged and Wiener indices of bipartite graphs
• On the revised Szeged index
• Szeged index, edge Szeged index, and semi-star trees
• The (revised) Szeged index and the Wiener index of a nonbipartite graph
• The normalized revised Szeged index
• The revised edge Szeged index of bridge graphs
• Use of the Szeged index and the revised Szeged index for measuring network bipartivity
• Wiener index of trees: Theory and applications
• Wiener index versus Szeged index in networks

Cited in

(12)

• On the Steiner (revised) Szeged index
• On minimum revised edge Szeged index of bicyclic graphs
• Bicyclic graphs with maximal edge revised Szeged index
• Cactus graphs with minimum edge revised Szeged index
• A lower bound of revised Szeged index of bicyclic graphs
• Extremal tricyclic graphs with respect to Schultz index.
• Counting independent sets in tricyclic graphs
• The lower bound of revised Szeged index with respect to tricyclic graphs
• Bicyclic graphs with maximal revised Szeged index
• On extremal cacti with respect to the revised Szeged index
• On the revised Szeged index of unicyclic graphs with given diameter
• On extremal cacti with respect to the Szeged index

This page was built for publication: Tricyclic graphs with maximal revised Szeged index

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q406325)