Zobrazeno 1 - 10
of 43 324
pro vyhledávání: '"A. Neumaier"'
Autor:
Jazaeri, Mojtaba
A graph $\Gamma$ is called edge-regular whenever it is regular and for any two adjacent vertices the number of their common neighbors is independent of the choice of vertices. A clique $C$ in $\Gamma$ is called regular whenever for any vertex out of
Externí odkaz:
http://arxiv.org/abs/2408.13722
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
Autor:
Jazaeri, Mojtaba
A Neumaier graph is a non-complete edge-regular graph with the property that it has a regular clique. In this paper, we study Neumaier Cayley graphs. We give a necessary and sufficient condition under which a Neumaier Cayley graph is a strongly regul
Externí odkaz:
http://arxiv.org/abs/2308.11572
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
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
We present a construction of Neumaier graphs with nexus 1, which generalises two known constructions of Neumaier graphs. We also use W. Wang, L. Qiu, and Y. Hu switching to show that we construct cospectral Neumaier graphs. Finally, we show that seve
Externí odkaz:
http://arxiv.org/abs/2109.13884
Publikováno v:
In Discrete Mathematics July 2023 346(7)
Publikováno v:
In Journal of Combinatorial Theory, Series A January 2023 193
A Neumaier graph is a non-complete edge-regular graph containing a regular clique. In this paper we give some sufficient and necessary conditions for a Neumaier graph to be strongly regular. Further we show that there does not exist Neumaier graphs w
Externí odkaz:
http://arxiv.org/abs/2007.07520
A regular clique in a regular graph is a clique such that every vertex outside of the clique is adjacent to the same positive number of vertices inside the clique. We continue the study of regular cliques in edge-regular graphs initiated by A. Neumai
Externí odkaz:
http://arxiv.org/abs/1809.03417