Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2512.00618

On the Augmented Sombor Index of Graphs

Kinkar Chandra Das·Akbar Ali
View original source ↗Read source document ↗Export metadata ↓

Abstract

Let $G$ be a connected graph having more than two vertices and let $d_i$ denote the degree of vertex $v_i$ in $G$. Let $E(G)$ represent the edge set of $G$. Then, the augmented Sombor (ASO) index of $G$ is defined as $ASO(G) = \sum_{v_i v_j \in E(G)} \sqrt{(d_i + d_j - 2)^{-1}(d_i^2 + d_j^2)}.$ It is known that the cycle graph $C_n$ uniquely minimizes the ASO index in the class of all $n$-order unicyclic graphs. In this paper, we prove that the unique $n$-order unicyclic graph of maximum degree $n-1$ maximizes the ASO index in the aforementioned unicyclic graph class. We also prove that $ASO(G-v_iv_j)<ASO(G)$ whenever neither of the graphs $G-v_iv_j$ and $G$ contains any isolated edge. Utilizing this edge-deletion property, we characterize the unique graph maximizing the ASO index among all fixed-order connected graphs with a specified vertex connectivity (or edge connectivity).

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Kinkar Chandra Das, Akbar Ali. 2025-11-29. On the Augmented Sombor Index of Graphs. https://arxiv.org/abs/2512.00618

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO↗
arXiv2026

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO↗