相关论文: Understanding ramification of branched {$\mathbb{Z…
We initiate the study of Iwasawa theory for branched $\mathbb{Z}_{p}$-towers of finite connected graphs. These towers are more general than what have been studied so far, since the morphisms of graphs involved are branched covers, a…
Recently Iwasawa theory for graphs is developing. A significant achievement includes an analogue of Iwasawa class number formula, which describes the asymptotic growth of the numbers of spanning trees for $\mathbb{Z}_p$-coverings of graphs.…
For a $\mathbb{Z}_p$-covering of connected graphs, an analogue of Iwasawa's class number formula describes the growth of the number of spanning trees in terms of Iwasawa $\lambda$- and $\mu$-invariants. In this paper, we show that any pair…
In this article, we study questions pertaining to ramified $\mathbb{Z}_p^d$-extensions of a finite connected graph $X$. We also study the Iwasawa theory of dual graphs.
This paper discusses the enumeration for the total number of all rooted spanning forests of the labeled complete tripartite graph. We enumerate the total number by a combinatorial decomposition.
We investigate the growth of the $p$-part of the Jacobians in voltage covers of finite connected multigraphs, where the voltage group is isomorphic to $\mathbb{Z}_p^l$ for some ${l \ge 2}$, and we study analogues of a conjecture of…
We consider all spanning trees of a complete simple graph $\Gamma$ on $n$ vertices that contain a given $m-$forest $F$. We show that the number of such spanning trees, $\tau(F)$, doesn't depend on the structure of $F$ and is completely…
We show that if a graph admits a packing and a covering both consisting of $\lambda$ many spanning trees, where $\lambda$ is some infinite cardinal, then the graph also admits a decomposition into $\lambda$ many spanning trees. For finite…
Using the special value at $u=1$ of Artin-Ihara $L$-functions, we associate to every $\mathbb{Z}$-cover of a finite connected graph a polynomial which we call the \emph{Ihara polynomial}. We show that the number of spanning trees for the…
Building on work by Desjarlais, Molina, Faase, and others, a general method is obtained for counting the number of spanning trees of graphs that are a product of an arbitrary graph and either a path or a cycle, of which grid graphs are a…
We discuss a recursive formula for number of spanning trees in a graph. The paper is written primary for school students.
The aim of this chapter is to provide an adequate graph theoretic framework for the description of periodic bifurcations which have recently been discovered in descendant trees of finite p-groups. The graph theoretic concepts of rooted…
In this paper we give an exact analytical expression for the number of spanning trees of an infinite family of outerplanar, small-world and self-similar graphs. This number is an important graph invariant related to different topological…
To each generic complex polynomial $p(z)$ there is associated a labeled binary tree (here referred to as a "lemniscate tree") that encodes the topological type of the graph of $|p(z)|$. The branching structure of the lemniscate tree is…
We give a proof for sharp estimate for the number of spanning trees using linear algebra and generalize this bound to multigraphs. In addition, we show that this bound is tight for complete graphs. In addition, we give estimates for number…
Let $\ell$ be a prime number. The Iwasawa theory of multigraphs is the systematic study of growth patterns in the number of spanning trees in abelian $\ell$-towers of multigraphs. In this context, growth patterns are realized by certain…
We revisit the theory of Ihara $L$-functions in the context initially studied by Bass and Hashimoto and more recently by Zakharov. In particular, we study if the Artin formalism is satisfied by these $L$-functions. As an application, we…
We study the problem of connecting the parts of a multipartite graph using a minimum number of edges under a matching constraint. We introduce interconnection trees, defined as matchings whose projections onto the quotient graph form a…
In this paper we construct spanning trees in hyperbolic graphs that represent their hyperbolic compactification in a good way: so that the tree has a bounded number of distinct rays to each boundary point. The bound depends only on the…
Using the method of spectral decimation and a modified version of Kirchhoffs Matrix-Tree Theorem, a closed form solution to the number of spanning trees on approximating graphs to a fully symmetric self-similar structure on a finitely…