Related papers: A note on non-regular Bonnet-Myers Sharp Graphs
We study here the graphs with seven vertices in an effort to classify which of them appear as the prime character degree graphs of finite solvable groups. This classification is complete for the disconnected graphs. Of the 853…
The degree-diameter problem seeks to find the largest possible number of vertices in a graph having given diameter and given maximum degree. There has been much recent interest in the problem for mixed graphs, where we allow both undirected…
A fullerene graph is a cubic bridgeless plane graph with only pentagonal and hexagonal faces. We exhibit an infinite family of fullerene graphs of diameter $\sqrt{4n/3}$, where $n$ is the number of vertices. This disproves a conjecture of…
It is known that the number of vertices of a graph of diameter two cannot exceed $d^2+1$. In this contribution we give a new lower bound for orders of Cayley graphs of diameter two in the form $C(d,2)>0.684d^2$ valid for all degrees $d\geq…
The degree-diameter problem seeks to find the maximum possible order of a graph with a given (maximum) degree and diameter. It is known that graphs attaining the maximum possible value (the Moore bound) are extremely rare, but much activity…
In this paper, we classify connected amply regular graphs with diameter $d \geq 4$ and parameters $(v, k, \lambda, \mu)$ satisfying $\mu = \frac{k-1}{2}$, where $k\geq 5$ is odd. We prove that such a graph must be exactly one of the…
We consider the problem of classifying those graphs that arise as an undirected square of an oriented graph by generalising the notion of quasi-transitive directed graphs to mixed graphs. We fully classify those graphs of maximum degree…
A connected symmetric graph of prime valency is {\em basic} if its automorphism group contains no nontrivial normal subgroup having more than two orbits. Let $p$ be a prime and $n$ a positive integer. In this paper, we investigate…
The classical problem of characterizing the graphs with bounded eigenvalues may date back to the work of Smith in 1970. Especially, the research on graphs with smallest eigenvalues not less than $-2$ has attracted widespread attention.…
Let $\lambda\geq2$ be an integer. For strongly regular graphs with parameters $(v, k, a,c)$ and smallest eigenvalue $-\lambda$, Neumaier gave two bounds on $c$ by using algebraic property of strongly regular graphs. In this paper, we will…
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,…
It is a well-known fact that a graph of diameter $d$ has at least $d+1$ eigenvalues. Let us call a graph \emph{$d$-extremal} if it has diameter $d$ and exactly $d+1$ eigenvalues. Such graphs have been intensively studied by various authors.…
We classify all graphs for which the Rees algebras of their edge ideals are normal and have regularity equal to their matching numbers.
In this paper, we provide a natural bijection between a special family of block circulant graphs and the graphs of critical pairs of the posets known as generalized crowns. In particular, every graph in this family of block circulant graphs…
We give variants of the Krein bound and the absolute bound for graphs with a spectrum similar to that of a strongly regular graph. In particular, we investigate what we call approximately strongly regular graphs. We apply our results to…
The critical group of a finite graph is an abelian group defined by the Smith normal form of the Laplacian. We determine the the critical groups of the Peisert graphs, a certain family of strongly regular graphs similar to, but different…
For every infinite sequence of simple groups of Lie type of growing rank we exhibit connected Cayley graphs of degree at most 10 such that the isoperimetric number of these graphs converges to 0. This proves that these graphs do not form a…
A recent result of Chepoi, Estellon and Vaxes [DCG '07] states that any planar graph of diameter at most 2R can be covered by a constant number of balls of size R; put another way, there are a constant-sized subset of vertices within which…
We introduce a notion of curvature on finite, combinatorial graphs. It can be easily computed by solving a linear system of equations. We show that graphs with curvature bounded below by $K>0$ have diameter bounded by $\mbox{diam}(G) \leq…
In this paper, we study the net-regular strongly regular signed graphs with degree 6 and determine all connected 6-regular and net-regular strongly regular signed graphs. There are three, six and four 6-regular strongly regular signed…