Extremal Polygonal Cacti for General Sombor Index
Jiachang Ye, Jianguo Qian

TL;DR
This paper investigates extremal properties of the generalized Sombor index in k-polygonal cacti, establishing bounds and characterizing extremal structures, especially in chemical graph contexts.
Contribution
It provides the first lower bounds on the mbda-Sombor index for k-polygonal cacti and characterizes extremal graphs for specific parameter choices.
Findings
Lower bounds on mbda-Sombor index for k-polygonal cacti.
Characterization of extremal chemical k-polygonal cacti.
Analysis of extremal structures for specific mbda and eta values.
Abstract
The Sombor index of a graph was recently introduced by Gutman from the geometric point of view, defined as , where is the degree of a vertex . For two real numbers and , the -Sombor index and general Sombor index of are two generalized forms of the Sombor index defined as and , respectively. A -polygonal cactus is a connected graph in which every block is a cycle of length . In this paper, we establish a lower bound on -Sombor index for -polygonal cacti and show that the bound is attained only by chemical -polygonal cacti. The extremal -polygonal cacti for with some particular and are also…
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 · Synthesis and Properties of Aromatic Compounds · Computational Drug Discovery Methods
