Zobrazeno 1 - 10
of 436
pro vyhledávání: '"Zeijlemaker BY"'
Autor:
Abiad, Aida, Zeijlemaker, Sjanne
A unified framework for the Expander Mixing Lemma for irregular graphs using adjacency eigenvalues is presented, as well as two new versions of it. While the existing Expander Mixing Lemmas for irregular graphs make use of the notion of volume (the s
Externí odkaz:
http://arxiv.org/abs/2401.07125
A Neumaier graph is a non-complete edge-regular graph containing a regular clique. In this work, we prove several results on the existence of small strictly Neumaier graphs. In particular, we present a theoretical proof of the uniqueness of the small
Externí odkaz:
http://arxiv.org/abs/2308.15406
We determine the diameter of generalized Grassmann graphs and the zero forcing number of some generalized Johnson graphs, generalized Grassmann graphs and the Hamming graphs. Our work extends several previously known results.
Externí odkaz:
http://arxiv.org/abs/2302.07757
For $k\ge 1$, the $k$-independence number $\alpha_k$ of a graph is the maximum number of vertices that are mutually at distance greater than $k$. The well-known inertia and ratio bounds for the (1-)independence number $\alpha(=\alpha_1)$ of a graph,
Externí odkaz:
http://arxiv.org/abs/2201.04901
A Neumaier graph is a non-complete edge-regular graph containing a regular clique. A Neumaier graph that is not strongly regular is called a strictly Neumaier graph. In this work we present a new construction of strictly Neumaier graphs, and using Ja
Externí odkaz:
http://arxiv.org/abs/2109.14281
Weight-equitable partitions of graphs, which are a natural extension of the well-known equitable partitions, have been shown to be a powerful tool to weaken the regularity assumption in several well-known eigenvalue bounds. In this work we aim to fur
Externí odkaz:
http://arxiv.org/abs/2109.03005
Publikováno v:
In Discrete Applied Mathematics 15 May 2024 348:221-230
The $k^{\text{th}}$ power of a graph $G=(V,E)$, $G^k$, is the graph whose vertex set is $V$ and in which two distinct vertices are adjacent if and only if their distance in $G$ is at most $k$. This article proves various eigenvalue bounds for the ind
Externí odkaz:
http://arxiv.org/abs/2010.12649
Publikováno v:
In Discrete Applied Mathematics 15 July 2023 333:96-109
Publikováno v:
In Journal of Combinatorial Theory, Series A January 2023 193