相关论文: Dimer-monomer Model on the Towers of Hanoi Graphs

We study the number of dimer-monomers $M_d(n)$ on the Tower of Hanoi graphs $TH_d(n)$ at stage $n$ with dimension $d$ equal to 3 and 4. The entropy per site is defined as $z_{TH_d}=\lim_{v \to \infty} \ln M_d(n)/v$, where $v$ is the number…

We study partition functions for the dimer model on families of finite graphs converging to infinite self-similar graphs and forming approximation sequences to certain well-known fractals. The graphs that we consider are provided by actions…

The entropy of a monomer-dimer system on an infinite bipartite lattice can be written as a mean-field part plus a series expansion in the dimer density. In a previous paper it has been conjectured that all coefficients of this series are…

In this paper, we study the entropy of a hard random geometric graph (RGG), a commonly used model for spatial networks, where the connectivity is governed by the distances between the nodes. Formally, given a connection range $r$, a hard…

Let $G$ be a large (simple, unlabeled) dense graph on $n$ vertices. Suppose that we only know, or can estimate, the empirical distribution of the number of subgraphs $F$ that each vertex in $G$ participates in, for some fixed small graph…

The number of spanning trees of a graph is an important invariant related to topological and dynamic properties of the graph, such as its reliability, communication aspects, synchronization, and so on. However, the practical enumeration of…

In this paper we review the asymptotic matching conjectures for $r$-regular bipartite graphs, and their connections in estimating the monomer-dimer entropies in $d$-dimensional integer lattice and Bethe lattices. We prove new rigorous upper…

We consider the disordered monomer-dimer model on cylinder graphs $\mathcal{G}_n$, i.e., graphs given by the Cartesian product of the line graph on $n$ vertices, and a deterministic graph. The edges carry i.i.d. random weights, and the…

Let $G=(V,E)$ be a finite simple graph. The Sombor index $SO(G)$ of $G$ is defined as $\sum_{uv\in E(G)}\sqrt{d_u^2+d_v^2}$, where $d_u$ is the degree of vertex $u$ in $G$. Let $G$ be a connected graph constructed from pairwise disjoint…

This survey paper deals with upper and lower bounds on the number of $k$-matchings in regular graphs on $N$ vertices. For the upper bounds we recall the upper matching conjecture which is known to hold for perfect matchings. For the lower…

A numerical parameter, referred to as a topological index, is used to represent the molecular structure of a compound by analyzing its graph-theoretical characteristics. Topological indices are predictive methods for the physicochemical…

Finite dimensional representations of the Hanoi Towers group are used to calculate the spectra of the finite graphs associated to the Hanoi Towers Game on three pegs (the group serves as a renorm group for the game). These graphs are…

By using the transfer matrix approach, we investigate the asymptotic behavior of the entropy of flexible chains with $M$ monomers each placed on stripes. In the limit of high density of monomers, we study the behavior of the entropy as a…

We continue the discussion of the fermion models on graphs that started in the first paper of the series. Here we introduce a Graphical Gauge Model (GGM) and show that : (a) it can be stated as an average/sum of a determinant defined on the…

For a graph $G$ with edge set $E$, let $d(u)$ denote the degree of a vertex $u$ in $G$. The diminished Sombor (DSO) index of $G$ is defined as $DSO(G)=\sum_{uv\in E}\sqrt{(d(u))^2+(d(v))^2}(d(u)+d(v))^{-1}$. The cyclomatic number of a graph…

We study the richness of the ensemble of graphical structures (i.e., unlabeled graphs) of the one-dimensional random geometric graph model defined by $n$ nodes randomly scattered in $[0,1]$ that connect if they are within the connection…

We study the problem of deterministic approximate counting of matchings and independent sets in graphs of bounded connective constant. More generally, we consider the problem of evaluating the partition functions of the monomer-dimer model…

Carbon nanotube Y-junctions are of great interest to the next generation of innovative multi-terminal nanodevices. Topological indices are graph-theoretically based parameters that describe various structural properties of a chemical…

Let ${\rm dim}(G)$ and $D(G)$ respectively denote the metric dimension and the distinguishing number of a graph $G$. It is proved that $D(G) \le {\rm dim}(G)+1$ holds for every connected graph $G$. Among trees, exactly paths and stars…

We improve the best known lower bounds on the exponential behavior of the maximum of the number of connected sets, $N(G)$, and dominating connected sets, $N_{dom}(G)$, for regular graphs. These lower bounds are improved by constructing a…