On extremal cacti with respect to the edge Szeged index and edge-vertex Szeged index

DOI10.2298/FIL1811069HzbMATH Open1499.05127arXiv1711.02394WikidataQ128009825 ScholiaQ128009825MaRDI QIDQ5083160FDOQ5083160

Rong-Xia Hao, Ai-Mei Yu, Shengjie He

Publication date: 21 June 2022

Published in: Filomat (Search for Journal in Brave)

Abstract: The edge Szeged index and edge-vertex Szeged index of a graph are defined as $S{z}_e(G)=sumlimit{s}_{uvinE(G)}{m}_u(uv|G)m_v(uv|G)$ and $S{z}_{ev}(G)=frac12sumlimit{s}_{uvinE(G)}[n_u(uv|G)m_v(uv|G)+n_v(uv|G)m_u(uv|G)],$ respectively, where $m_u(uv|G)$ (resp., $m_v(uv|G)$) is the number of edges whose distance to vertex $u$ (resp., $v$) is smaller than the distance to vertex $v$ (resp., $u$), and $n_u(uv|G)$ (resp., $n_v(uv|G)$) is the number of vertices whose distance to vertex $u$ (resp., $v$) is smaller than the distance to vertex $v$ (resp., $u$), respectively. A cactus is a graph in which any two cycles have at most one common vertex. In this paper, the lower bounds of edge Szeged index and edge-vertex Szeged index for cacti with order $n$ and $k$ cycles are determined, and all the graphs that achieve the lower bounds are identified.

Full work available at URL: https://arxiv.org/abs/1711.02394

zbMATH Keywords

cactusedge Szeged indexedge-vertex Szeged index

Mathematics Subject Classification ID

Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09) Connectivity (05C40) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) 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?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Wiener index of trees: Theory and applications
• On a conjecture about the Szeged index
• L-fuzzy sets
• The (revised) Szeged index and the Wiener index of a nonbipartite graph
• Bicyclic graphs with maximal revised Szeged index
• On the further relation between the (revised) Szeged index and the Wiener index of graphs
• Vertex and edge PI indices of Cartesian product graphs
• A matrix method for computing Szeged and vertex PI indices of join and composition of graphs
• Separability properties of almost-disjoint families of sets
• Revised and edge revised Szeged indices of graphs
• The Maximum Wiener Index of Trees with Given Degree Sequences
• On the distance Laplacian spectral radius of graphs
• Bounds for the sum-Balaban index and (revised) Szeged index of regular graphs
• On extremal cacti with respect to the Szeged index

Cited In (7)

• Title not available (Why is that?)
• Cacti with \(n\)-vertices and \(t\) cycles having extremal Wiener index
• On cacti with large Mostar index
• On the edge-Szeged index of unicyclic graphs with perfect matchings
• On the sharp bounds of bicyclic graphs regarding edge Szeged index
• On extremal cacti with respect to the revised Szeged index
• On the extremal cactus graphs for variable sum exdeg index with a fixed number of cycles

   Recommendations

• On extremal cacti with respect to the Szeged index 👍 👎
• On extremal cacti with respect to the revised Szeged index 👍 👎
• Cactus graphs with minimum edge revised Szeged index 👍 👎
• Title not available (Why is that?) 👍 👎
• On Extremal Graphs of Weighted Szeged Index 👍 👎
• Cacti with \(n\)-vertices and \(t\) cycles having extremal Wiener index 👍 👎
• On the extremal cactus graphs for variable sum exdeg index with a fixed number of cycles 👍 👎
• On the Revised Edge-Szeged Index of Graphs 👍 👎
• Title not available (Why is that?) 👍 👎
• Computation of edge Pi index, vertex Pi index and Szeged index of some cactus chains 👍 👎

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

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