The smallest strictly Neumaier graph and its generalisations [Elektronski vir]
Evans, Rhys J. ; Goryainov, Sergey ; Panasenko, Dmitry
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. Neumaier in the 1980s and attracting current interest. We thus define a Neumaier graph to be an non-complete edge-regular graph containing a regular clique, and a strictly Neumaier graph to be a non-strongly regular Neumaier graph. We first prove some general results on Neumaier graphs and their feasible parameter tuples. We then apply these results to determine the smallest strictly Neumaier graph, which has ▫$16$▫ vertices. Next we find the parameter tuples for all strictly Neumaier graphs having at most ▫$24$▫ vertices. Finally, we give two sequences of graphs, each with ▫$i^{th}$▫ element a strictly Neumaier graph containing a ▫$2^i$▫-regular clique (where ▫$i$▫ is a positive integer) and having parameters of an affine polar graph as an edge-regular graph. This answers questions recently posed by G. Greaves and J. Koolen.
It was not necessary to add the material to the shelf.
Bibliographic material was successfully added on shelf.
Adding bibliographical material on shelf was not successful.
Material is already on the shelf.
Permalink
URL:
Impact factor
Access to the JCR database is permitted only to users from Slovenia. Your current IP address is not on the list of IP addresses with access permission, and authentication with the relevant AAI accout is required.
Year
Impact factor
Edition
Category
Classification
JCR
SNIP
JCR
SNIP
JCR
SNIP
JCR
SNIP
Impact factor
Select the library membership card:
DRS,
in which the journal is indexed
Database name
Field
Year
Links to authors' personal bibliographies
Links to information on researchers in the SICRIS system
Subject headings in COBISS General List of Subject Headings
Select pickup location
The material from the parent unit is free. If the material is delivered to the pickup location from another unit, the library may charge you for this service.
PDF
