Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2604.06839

Extremal Mostar Index of Graphs with Given Number of Cut Edges

Sunilkumar M. Hosamani
View original source ↗Read source document ↗Export metadata ↓

Abstract

The Mostar index of a connected graph \(G\) is defined as \[ Mo(G)=\sum_{uv\in E(G)}\bigl|n_u(uv)-n_v(uv)\bigr|, \] where for an edge \(e=uv\), \(n_u(e)\) denotes the number of vertices of \(G\) that are closer to \(u\) than to \(v\). In this paper, we determine the maximum possible Mostar index among all connected graphs of order \(n\) with exactly \(k\) cut edges, where \(1\le k\le n-1\). We prove that the maximum value is given by \(k(n-2)+(n-k-1)k\), and the unique extremal graph is \(K_{n-k}^k\) (a complete graph on \(n-k\) vertices with \(k\) pendant edges attached to a single vertex). We also establish a sharp lower bound and characterise the extremal graphs for the minimum value. Furthermore, we extend the results to graphs with a given cyclomatic number and a given number of cut edges. Our findings complete the extremal characterisation of the Mostar index for this fundamental graph class.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Sunilkumar M. Hosamani. 2026-04-08. Extremal Mostar Index of Graphs with Given Number of Cut Edges. https://arxiv.org/abs/2604.06839

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↗