On extremal cacti with respect to the edge revised Szeged index
Shengjie He, Rong-Xia Hao, Deming Li

TL;DR
This paper characterizes extremal cacti graphs with respect to the edge revised Szeged index, identifying those with minimal and second minimal index values among cacti with given order and number of cycles.
Contribution
It determines the extremal cacti graphs with the lowest and second-lowest edge revised Szeged index for specified parameters, expanding understanding of graph invariants.
Findings
Identified cacti with minimal edge revised Szeged index.
Determined second minimal index cacti.
Characterized all extremal graphs achieving these indices.
Abstract
Let be a connected graph. The edge revised Szeged index of is defined as , where (resp., ) is the number of edges whose distance to vertex (resp., ) is smaller than the distance to vertex (resp., ), and is the number of edges equidistant from both ends of . In this paper, we give the minimal and the second minimal edge revised Szeged index of cacti with order and cycles, and all the graphs that achieve the minimal and second minimal edge revised Szeged index are identified.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph theory and applications · Analytic and geometric function theory · Mathematical Approximation and Integration
