Related papers: Counting spanning trees on fractal graphs and thei…
The tree of decomposition of a $k$-connected graph by a set $\mathfrak S$ of pairwise independent $k$-vertex cutsets is defined as follows. The vertices of this tree are cutsets of $\mathfrak S$ and parts of decomposition of the graph by…
The vertices of the Cayley graph of a finitely generated semigroup form a set of sites which can be labeled by elements of a finite alphabet in a manner governed by a nonnegative real interaction matrix, respecting nearest neighbor…
Graph polynomials encode fundamental combinatorial invariants of graphs. Their computation is investigated using tree and path decomposition frameworks, with formal definitions of treewidth, k-trees, and pathwidth establishing the…
We prove that every graph which admits a tree-decomposition into finite parts has a rooted tree-decomposition into finite parts that is linked, tight and componental. As an application, we obtain that every graph without half-grid minor has…
A spanning tree $T$ of a connected graph $G$ is a subgraph of $G$ that is a tree covers all vertices of $G$. The leaf distance of $T$ is defined as the minimum of distances between any two leaves of $T$. A fractional matching of a graph $G$…
Let $F(G)$ be the number of spanning forests in a graph $G$ and $\mathcal{C}(n,d)$ be the set of all connected $d$-regular simple graphs of order $n$. Define $\widehat{f}_{d}=\liminf_{n\rightarrow \infty}\{F(G)^{1/n}:G\in…
Designing well-connected graphs is a fundamental problem that frequently arises in various contexts across science and engineering. The weighted number of spanning trees, as a connectivity measure, emerges in numerous problems and plays a…
Building upon [1], this study aims to introduce fractal geometry into graph theory, and to establish a potential theoretical foundation for complex networks. Specifically, we employ the method of substitution to create and explore…
A graph can be regarded as an electrical network in which each edge is a resistor. This point of view relates combinatorial quantities, such as the number of spanning trees, to electrical ones such as effective resistance. The second and…
It is well-known that the number of spanning trees, denoted by $\tau(G)$, in a connected multi-graph $G$ can be calculated by the Matrix-Tree theorem and Tutte's deletion-contraction theorem. In this short note, we find an alternate method…
The method of spectral decimation is applied to an infinite collection of self--similar fractals. The sets considered belong to the class of nested fractals, and are thus very symmetric. An explicit construction is given to obtain formulas…
By using biclique partitions of digraphs, this paper gives reduction formulas for the number of oriented spanning trees, stationary distribution vector and Kemeny's constant of digraphs. As applications, we give a method for enumerating…
Motivated by the study of attractors in the Kuramoto model (KM) on graphs approximating the Sierpinski gasket (SG), we revisit the problem of harmonic maps (HMs) from SG to the circle, first considered by Strichartz. We provide a geometric…
This article develops analysis on fractal $3N$-gaskets, a class of post-critically finite fractals which include the Sierpinski triangle for $N=1$, specifically properties of the Laplacian $\Delta$ on these gaskets. We first prove the…
Finding spanning trees under various constraints is a classic problem with applications in many fields. Recently, a novel notion of "dense" ("sparse") tree, and in particular spanning tree (DST and SST respectively), is introduced as the…
We obtain the numbers of spanning trees on the Sierpinski gasket $SG_d(n)$ with dimension $d$ equal to two, three and four. The general expression for the number of spanning trees on $SG_d(n)$ with arbitrary $d$ is conjectured. The numbers…
In this article we study the energy level spectrum of fractals which have block-hierarchical structures. We develop a method to study the spectral properties in terms of linearization of spectral decimation procedure and verify it…
We generalize the definition and enumeration of spanning trees from the setting of graphs to that of arbitrary-dimensional simplicial complexes $\Delta$, extending an idea due to G. Kalai. We prove a simplicial version of the Matrix-Tree…
A novel approach for non-intrusive uncertainty propagation is proposed. Our approach overcomes the limitation of many traditional methods, such as generalised polynomial chaos methods, which may lack sufficient accuracy when the quantity of…
In the quadratic minimum spanning tree problem (QMSTP) one wants to find the minimizer of a quadratic function over all possible spanning trees of a graph. We present a formulation of the QMSTP as a mixed-integer semidefinite program…