[HTML][HTML] On large regular (1, 1, k)-mixed graphs
Abstract An (r, z, k)-mixed graph G has every vertex with undirected degree r, directed in-and
out-degree z, and diameter k. In this paper, we study the case r= z= 1, proposing some new …
out-degree z, and diameter k. In this paper, we study the case r= z= 1, proposing some new …
On the existence of small strictly Neumaier graphs
A Abiad, M De Boeck, S Zeijlemaker - Graphs and Combinatorics, 2024 - Springer
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 …
work, we prove several results on the existence of small strictly Neumaier graphs. In …
[HTML][HTML] Almost Moore and the largest mixed graphs of diameters two and three
C Dalfó, MA Fiol, N López - Linear Algebra and its Applications, 2024 - Elsevier
Almost Moore mixed graphs appear in the context of the degree/diameter problem as a class
of extremal mixed graphs, in the sense that their order is one unit less than the Moore bound …
of extremal mixed graphs, in the sense that their order is one unit less than the Moore bound …