Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2501.10828

Strong isometric path complexity of graphs: Asymptotic minors, restricted holes, and graph operations

Dibyayan Chakraborty·Florent Foucaud
View original source ↗Read source document ↗Export metadata ↓

Abstract

The (strong) isometric path complexity is a recently introduced graph invariant that captures how arbitrary isometric paths (i.e., shortest paths) of a graph can be viewed as a union of a few ``rooted" isometric paths (i.e., isometric paths with a common end-vertex). We show that important graph classes studied in \emph{coarse graph theory} have bounded strong isometric path complexity. Let $U_t$ denote the graph obtained by adding a universal vertex to a path of $t-1$ edges. We show that the strong isometric path complexity of $U_t$-asymptotic minor-free graphs is bounded. This implies that $K_4^-$-asymptotic minor-free graphs, i.e., graphs that are quasi-isometric to a cactus [Fujiwara \& Papasoglu '23], have bounded strong isometric path complexity. On the other hand, $K_4$-minor-free graphs have unbounded strong isometric path complexity. Hence, for a graph $H$ on at most four vertices, $H$-asymptotic minor-free graphs have bounded (strong) isometric path complexity if and only if $H\not=K_4$. We show that graphs whose all induced cycles of length at least 4 have the same length (also known as monoholed graphs as defined by [Cook et al., \textsc{JCTB '24}]) form a subclass of $U_4$-asymptotic minor-free graphs. Hence, the strong isometric path complexity of monoholed graphs is bounded. On the other hand, we show that even-hole free graphs have unbounded strong isometric path complexity. We investigate which graph operations preserve strong isometric path complexity. We show that the strong isometric path complexity is preserved under the \emph{fixed power} and \emph{line graph} operators, two important graph operations. We also show that the \emph{clique-sums} of finitely many graphs with strong isometric path complexity at most $k$, yield a graph with strong isometric path complexity at most $3k+18$.

Explore related subjects

math.COcs.DM

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Dibyayan Chakraborty, Florent Foucaud. 2025-09-04. Strong isometric path complexity of graphs: Asymptotic minors, restricted holes, and graph operations. https://arxiv.org/abs/2501.10828

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

KEEP EXPLORING

Related papers

arXiv2026

Matching Complexes of Outerplanar Graphs

An outerplanar graph is a planar graph that has a planar drawing with all vertices on the unbounded face. The matching complex of a graph is the simplicial complex whose faces are subsets of disjoint edges of the graph. In this paper we prove that the matching complexes of outerplanar graphs are contractible or homotopy equivalent to a wedge of spheres. This extends known results about trees and polygonal line tilings.

math.CO↗
arXiv2026

Awesome graph parameters

For a graph $G$, we denote by $α(G)$ the size of a maximum independent set and by $ω(G)$ the size of a maximum clique in $G$. Our paper lies on the edge of two lines of research, related to $α$ and $ω$, respectively. One of them studies $α$-variants of graph parameters, such as $α$-treewidth or $α$-degeneracy. The second line deals with graph classes where some parameters are bounded by a function of $ω(G)$. A famous example of this type is the family of $χ$-bounded classes, where the chromatic number $χ(G)$ is bounded by a function of $ω(G)$. A Ramsey-type argument implies that if the $α$-variant of a graph parameter $ρ$ is bounded by a constant in a hereditary class $\mathcal{G}$, then $ρ$ is bounded by a function of $ω$ in $\mathcal{G}$. If the reverse implication also holds, we say that $ρ$ is awesome. Otherwise, we say that $ρ$ is awful. In the present paper, we identify a number of awesome and awful graph parameters, derive some algorithmic applications of awesomeness, and propose a number of open problems related to these notions.

math.CO↗
arXiv2026

Perfect matchings and $A_α$-spectral radius in 1-binding graphs

Let $G$ be a graph with vertex set $V(G)$ and edge set $E(G)$. For $α\in[0,1)$, we use $A_α(G)$ and $ρ_α(G)$ to denote the $A_α$-matrix and the $A_α$-spectral radius of $G$, respectively. The binding number $\mbox{bind}(G)$ of $G$ is defined by $\mbox{bind}(G)=\min\left\{\frac{|N_G(X)|}{|X|}:\emptyset\neq X\subseteq V(G),N_G(X)\neq V(G)\right\}$. If $\mbox{bind}(G)\geq1$, then $G$ is called 1-binding. A perfect matching in $G$ is a set of nonadjacent edges covering every vertex of $G$. Tutte proved that a graph $G$ of even order has a perfect matching if and only if $o(G-S)\leq|S|$ holds for every $S\subseteq V(G)$ [W. Tutte, The factorization of linear graphs, J. Lond. Math. Soc. 22 (1947) 107--111]. In this paper, we use Tutte's result to prove that a connected 1-binding graph $G$ of even order $n$ with $n\geq n(α)$ has a perfect matching unless $G=K_1\vee(K_{n-5}\cup K_3\cup K_1)$ if $ρ_α(G)\geqρ_α(K_1\vee(K_{n-5}\cup K_3\cup K_1))$, where $n(α)$ is defined as follows: $n(α)=\max\{18,\frac{2+8α}{1-2α}\}$ if $α\in[0,\frac{1}{2})$, and $n(α)=18$ if $α=\frac{1}{2}$.

math.CO↗