Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userEnumeration of Point-Determining Graphs
263
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
Point-determining graphs are graphs in which no two vertices have the same neighborhoods, co-point-determining graphs are those whose complements are point-determining, and bi-point-determining graphs are those both point-determining and co-point-determining. Bicolored point-determining graphs are point-determining graphs whose vertices are properly colored with white and black. We use the combinatorial theory of species to enumerate these graphs as well as the connected cases.
rate research
Read More
In this paper we are interested in the asymptotic enumeration of Cayley graphs. It has previously been shown that almost every Cayley digraph has the smallest possible automorphism group: that is, it is a digraphical regular representation (DRR). In this paper, we approach the corresponding question for undirected Cayley graphs. The situation is complicated by the fact that there are two infinite families of groups that do not admit any graphical regular representation (GRR). The strategy for digraphs involved analysing separately the cases where the regular group $R$ has a nontrivial proper normal subgroup $N$ with the property that the automorphism group of the digraph fixes each $N$-coset setwise, and the cases where it does not. In this paper, we deal with undirected graphs in the case where the regular group has such a nontrivial proper normal subgroup.
We present the first combinatorial scheme for counting labelled 4-regular planar graphs through a complete recursive decomposition. More precisely, we show that the exponential generating function of labelled 4-regular planar graphs can be computed effectively as the solution of a system of equations, from which the coefficients can be extracted. As a byproduct, we also enumerate labelled 3-connected 4-regular planar graphs, and simple 4-regular rooted maps.
Building on previous work by the present authors [Proc. London Math. Soc. 119(2):358--378, 2019], we obtain a precise asymptotic estimate for the number $g_n$ of labelled 4-regular planar graphs. Our estimate is of the form $g_n sim gcdot n^{-7/2} rho^{-n} n!$, where $g>0$ is a constant and $rho approx 0.24377$ is the radius of convergence of the generating function $sum_{nge 0}g_n x^n/n!$, and conforms to the universal pattern obtained previously in the enumeration of planar graphs. In addition to analytic methods, our solution needs intensive use of computer algebra in order to work with large systems of polynomials equations. In particular, we use evaluation and Lagrange interpolation in order to compute resultants of multivariate polynomials. We also obtain asymptotic estimates for the number of 2- and 3-connected 4-regular planar graphs, and for the number of 4-regular simple maps, both connected and 2-connected.
We consider pressing sequences, a certain kind of transformation of graphs with loops into empty graphs, motivated by an application in phylogenetics. In particular, we address the question of when a graph has precisely one such pressing sequence, thus answering an question from Cooper and Davis (2015). We characterize uniquely pressable graphs, count the number of them on a given number of vertices, and provide a polynomial time recognition algorithm. We conclude with a few open questions. Keywords: Pressing sequence, adjacency matrix, Cholesky factorization, binary matrix
We introduce a large family of combinatorial objects, called standard puzzles, defined by very simple rules. We focus on the standard puzzles for which the enumeration problems can be solved by explicit formulas or by classical numbers, such as binomial coefficients, Fibonacci numbers, tangent numbers, Catalan numbers, $ldots$
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
