Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userLinear programming bounds for regular graphs
353
0
0.0
(
0
)
Authors
Hiroshi Nozaki
Ask ChatGPT about the research
No Arabic abstract
Delsarte, Goethals, and Seidel (1977) used the linear programming method in order to find bounds for the size of spherical codes endowed with prescribed inner products between distinct points in the code. In this paper, we develop the linear programming method to obtain bounds for the number of vertices of connected regular graphs endowed with given distinct eigenvalues. This method is proved by some dual technique of the spherical case, motivated from the theory of association scheme. As an application of this bound, we prove that a connected $k$-regular graph satisfying $g>2d-1$ has the minimum second-largest eigenvalue of all $k$-regular graphs of the same size, where $d$ is the number of distinct non-trivial eigenvalues, and $g$ is the girth. The known graphs satisfying $g>2d-1$ are Moore graphs, incidence graphs of regular generalized polygons of order $(s,s)$, triangle-free strongly regular graphs, and the odd graph of degree $4$.
rate research
Read More
We study the curvature-dimension inequality in regular graphs. We develop techniques for calculating the curvature of such graphs, and we give characterizations of classes of graphs with positive, zero, and negative curvature. Our main result is to compare the curvature-dimension inequality in these classes to the so-called Ollivier curvature. A consequence of our results is that in the case that the graph contains no subgraph isomorphic to either $K_3$ or $K_{2,3}$ these curvatures usually have the same sign, and we characterize the exceptions.
We prove a `resilience version of Diracs theorem in the setting of random regular graphs. More precisely, we show that, whenever $d$ is sufficiently large compared to $varepsilon>0$, a.a.s. the following holds: let $G$ be any subgraph of the random $n$-vertex $d$-regular graph $G_{n,d}$ with minimum degree at least $(1/2+varepsilon)d$. Then $G$ is Hamiltonian. This proves a conjecture of Ben-Shimon, Krivelevich and Sudakov. Our result is best possible: firstly, the condition that $d$ is large cannot be omitted, and secondly, the minimum degree bound cannot be improved.
The Laplacian spread of a graph is the difference between the largest eigenvalue and the second-smallest eigenvalue of the Laplacian matrix of the graph. We find that the class of strongly regular graphs attains the maximum of largest eigenvalues, the minimum of second-smallest eigenvalues of Laplacian matrices and hence the maximum of Laplacian spreads among all simple connected graphs of fixed order, minimum degree, maximum degree, minimum size of common neighbors of two adjacent vertices and minimum size of common neighbors of two nonadjacent vertices. Some other extremal graphs are also provided.
For a graph $G,$ the set $D subseteq V(G)$ is a porous exponential dominating set if $1 le sum_{d in D} left( 2 right)^{1-dist(d,v)}$ for every $v in V(G),$ where $dist(d,v)$ denotes the length of the shortest $dv$ path. The porous exponential dominating number of $G,$ denoted $gamma_e^*(G),$ is the minimum cardinality of a porous exponential dominating set. For any graph $G,$ a technique is derived to determine a lower bound for $gamma_e^*(G).$ Specifically for a grid graph $H,$ linear programing is used to sharpen bound found through the lower bound technique. Lower and upper bounds are determined for the porous exponential domination number of the King Grid $mathcal{K_n},$ the Slant Grid $mathcal{S_n},$ and the $n$-dimensional hypercube $Q_n.$
Szemeredis Regularity Lemma is a very useful tool of extremal combinatorics. Recently, several refinements of this seminal result were obtained for special, more structured classes of graphs. We survey these results in their rich combinatorial context. In particular, we stress the link to the theory of (structural) sparsity, which leads to alternative proofs, refinements and solutions of open problems. It is interesting to note that many of these classes present challenging problems. Nevertheless, from the point of view of regularity lemma type statements, they appear as gentle classes.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
