Related papers: Two comments on balls in vertex transitive graphs
We investigate character degree graphs of solvable groups. In particular, we provide general results that can be used to eliminate which degree graphs can occur as solvable groups. Finally, we show a specific family of graphs cannot occur…
We give certain properties which are satisfied by the descendant set of a vertex in an infinite, primitive, distance transitive digraph of finite out-valency and provide a strong structure theory for digraphs satisfying these properties. In…
We consider a class of biased random walks on infinite graphs and present several general results on the spectral radius of biased random walk.
The shift graph is defined on the space of infinite subsets of natural numbers by letting two sets be adjacent if one can be obtained from the other by removing its least element. We show that this graph is not a minimum among the graphs of…
A $t$-walk-regular graph is a graph for which the number of walks of given length between two vertices depends only on the distance between these two vertices, as long as this distance is at most $t$. Such graphs generalize distance-regular…
The $L^2$-zeta function of an infinite graph Y (defined previously in a ball around zero) has an analytic extension. For a tower of finite graphs covered by Y, the normalized zeta functions of the finite graphs converge to the $L^2$-zeta…
A short proof of the equivalence of the recurrence of non-backtracking random walk and that of simple random walk on regular infinite graphs is given. It is then shown how this proof can be extended in certain cases where the graph in…
In this thesis we consider ordered graphs (that is, graphs with a fixed linear ordering on their vertices). We summarize and further investigations on the number of edges an ordered graph may have while avoiding a fixed forbidden ordered…
This paper presents a characterization of edge-transitive graphs which are four regular and have girth four. This class consists of four infinite families plus four exceptional graphs.
We make several new contributions to the study of proper holomorphic mappings between balls. Our results include a degree estimate for rational proper maps, a new gap phenomenon for convex families of arbitrary proper maps, and an…
Let G be a simple finite graph such that each vertex has an integer value and different vertices have different values. Let S be a finite non-empty set of primes. We call G an S-graph if any two vertices are connected by an edge if and only…
We resolve two problems of [Cameron, Praeger, and Wormald -- Infinite highly arc transitive digraphs and universal covering digraphs, Combinatorica 1993]. First, we construct a locally finite highly arc-transitive digraph with universal…
The presented material continues the previous article (arxiv:1007.1059) and also is devoted to the equivalent conversion between the graphs. The examining of the transformation of the vertex graphs into the edge graphs (together with the…
Mixed graphs can be seen as digraphs with arcs and edges (or digons, that is, two opposite arcs). In this paper, we consider the case where such graphs are bipartite and in which the undirected and directed degrees are one. The best graphs,…
A nut graph is a simple graph for which the adjacency matrix has a single zero eigenvalue such that all non-zero kernel eigenvectors have no zero entry. If the isolated vertex is excluded as trivial, nut graphs have seven or more vertices;…
The periodic discrete Toda equation defined over finite fields has been studied. We obtained the finite graph structures constructed by the network of states where edges denote possible time evolutions. We simplify the graphs by introducing…
We analyse an extremal question on the degrees of the link graphs of a finite regular graph, that is, the subgraphs induced by non-trivial spheres. We show that if $G$ is $d$-regular and connected but not complete then some link graph of…
An argument is given to associate integrable nonintegrable transition of discrete maps with the transition of Lawvere's fixed point theorem to its own contrapositive. We show that the classical description of nonlinear maps is neither…
We prove that a simple random walk on quasi-transitive graphs with the volume growth being faster than any polynomial of degree 4 has a.s. infinitely many cut times, and hence infinitely many cutpoints. This confirms a conjecture raised by…
Extending the work of Godsil and others, we investigate the notion of the inverse of a graph (specifically, of bipartite graphs with a unique perfect matching). We provide a concise necessary and sufficient condition for the invertibility…