Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2406.16205

Recursions Satisfied by Families of Determinants with Applications to Resistance Distance

Emily J. Evans·Russell J. Hendel
View original source ↗Read source document ↗Export metadata ↓

Abstract

The main contribution of this paper is a six-step semi-automatic algorithm that obtains a recursion satisfied by a family of determinants by systematically and iteratively applying Laplace expansion to the underlying matrix family. The recursion allows explicit computation of the Binet form providing a closed formula for resistance distance between two specified nodes in a family of graphs. This approach is particularly suited for graph families with complex structures; the method is used to prove the 1 over 14 conjectured asymptotic formula for linear 3--trees. Additionally, although the literature on recursive formulas for resistance distances is quite large, the Fibonacci Quarterly and the Proceedings have almost no such results despite the fact that many recursions related to resistance distances involve the Fibonacci numbers. Therefore, a secondary purpose of the paper is to provide a brief introductory survey of graph families, accompanied by figures, Laplacian matrices, and typical recursive results, supported by a modest bibliography of current papers on many relevant graph families, in the hope to involve Fibonaccians in this active and beautiful field.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Emily J. Evans, Russell J. Hendel. 2024-06-23. Recursions Satisfied by Families of Determinants with Applications to Resistance Distance. https://arxiv.org/abs/2406.16205

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

KEEP EXPLORING

Related papers

arXiv2026

On Perfect Divisibility of Bull-Free Graphs Without Long Paths

A graph $G$ is {\em perfectly divisible} if, for every induced subgraph $H$ of $G$, $V(H)$ can be partitioned into $A$ and $B$ such that $H[A]$ is perfect and $ω(H[B])<ω(H)$. Chudnovsky and Sivaraman [J. Graph Theory \textbf{90} (2019) 54-60] proved that every ($P_5$, bull)-free graph is perfectly divisible, while Chen and Xu [Discrete Appl. Math. \textbf{372} (2025) 298-307] proved the same for ($P_7,C_5$, bull)-free graphs. We extend these results by proving that every ($P_8,C_5$, bull)-free graph is perfectly divisible and that, letting $F$ denote the Grötzsch graph, a ($P_6$, bull)-free graph is perfectly divisible if and only if it is $F$-free.

math.CO↗
arXiv2026

Covering graphs by isometric trees

A connected subgraph of a graph is isometric if it preserves distances. Recently, graphs admitting a vertex or edge covering by a small number of isometric paths have been studied. In this paper, we consider the analogous problem for isometric trees, focusing on the treewidth of graphs admitting a vertex or edge covering by a small number of such trees. Baste, De Meyer, Giocanti, Objois, and Picavet showed that for coverings by two isometric trees, the treewidth is bounded. We show that already for three isometric trees, the treewidth can be linear in the number of vertices. On the positive side, we show that for graphs of bounded degree coverable by a small number of isometric trees, the treewidth is sublinear in the number of vertices.

math.CO↗
arXiv2026

Tree-independence number of $P_5$-free graphs with no large bicliques

The tree-independence number of a graph is the minimum, over all tree-decompositions of the graph, of the maximum size of an independent set contained in a bag. Graph classes of bounded tree-independence number have strong structural and algorithmic properties; however, the parameter can be unbounded even in quite restricted classes. In particular, the presence of an induced biclique $K_{\ell,\ell}$ forces tree-independence number at least $\ell$. This leads to the question whether large induced bicliques are the only obstruction to bounded tree-independence number in natural hereditary classes. A conjecture of Dallard, Krnc, Kwon, Milanič, Munaro, Štorgel, and Wiederrecht states that for all positive integers $t$ and $\ell$, ${\{P_t,K_{\ell,\ell}\}}$-free graphs have bounded tree-independence number. We prove this conjecture for ${t=5}$ by showing that every ${\{P_5,K_{\ell,\ell}\}}$-free graph has tree-independence number at most ${4\ell-4}$. We also obtain related bounds for the weaker parameter of $α$-degeneracy and answer a question of Hilaire, Milanič, and Vasić whether tree-independence number of ${\{P_5,K_{\ell,\ell}\}}$-free graphs exceeds $\ell$ by at most an additive constant.

math.CO↗