Zobrazeno 1 - 10
of 1 944
pro vyhledávání: '"05C30"'
Autor:
Clancy Jr, David
In a recent work on the bipartite Erd\H{o}s-R\'{e}nyi graph, Do et al. (2023) established upper bounds on the number of connected labeled bipartite graphs with a fixed surplus. We use some recent encodings of bipartite random graphs in order to provi
Externí odkaz:
http://arxiv.org/abs/2411.09419
Autor:
Cinkir, Zubeyir
We compute the total number of spanning trees for the generalized cone of the complete graph $K_n$ and a number of families of some modified bipartite graphs $K_{m,n}$. In particular, we obtain a new method of finding the number of spanning trees of
Externí odkaz:
http://arxiv.org/abs/2411.02874
Autor:
Paul, Pravakar, Saikia, Manjil P.
In this paper, we give inductive sum formulas to calculate the number of diagonally symmetric, and diagonally \& anti-diagonally symmetric domino tilings of Aztec Diamonds. As a byproduct, we also find such a formula for the unrestricted case as well
Externí odkaz:
http://arxiv.org/abs/2410.23324
Let $G$ be a simple graph. A dissociation set of $G$ is defined as a set of vertices that induces a subgraph in which every vertex has a degree of at most 1. A dissociation set is maximal if it is not contained as a proper subset in any other dissoci
Externí odkaz:
http://arxiv.org/abs/2410.20462
Autor:
Wachi, Hidetada
An interaction is a certain symmetric graph that describes the possible transition of states of adjacent sites of large-scale interacting systems. In the series of studies Bannai-Kametani-Sasada arXiv:2009.04699, Bannai-Sasada arXiv:2111.08934, they
Externí odkaz:
http://arxiv.org/abs/2410.11292
Autor:
De Paris, Alessandro
To investigate hyperbinary expansions of a nonnegative integer $n$, an edge-labelled directed graph $A(n)$ has recently been introduced. After pointing out some new simple facts about its cyclomatic number, we give a relatively simple description of
Externí odkaz:
http://arxiv.org/abs/2410.01422
We show that specific exponential bivariate integrals serve as generating functions of labeled edge-bicolored graphs. Based on this, we prove an asymptotic formula for the number of regular edge-bicolored graphs with arbitrary weights assigned to dif
Externí odkaz:
http://arxiv.org/abs/2409.18607
Autor:
Parui, Samiron
This study delves into the incidence matrices of hypergraphs, with a focus on two types: the edge-vertex incidence matrix and the vertex-edge incidence matrix. The edge-vertex incidence matrix is a matrix in which the rows represent hyperedges and th
Externí odkaz:
http://arxiv.org/abs/2409.16055
Autor:
Finch, Steven
We treat three cubic recurrences, two of which generalize the famous iterated map $x \mapsto x (1-x)$ from discrete chaos theory. A feature of each asymptotic series developed here is a constant, dependent on the initial condition but otherwise intri
Externí odkaz:
http://arxiv.org/abs/2409.15175
Autor:
Galvin, David, Sharpe, Courtney
The independent set sequence of trees has been well studied, with much effort devoted to the (still open) question of Alavi, Malde, Schwenk and Erd\H{o}s on whether the independent set sequence of any tree is unimodal. Much less attention has been gi
Externí odkaz:
http://arxiv.org/abs/2409.15555