7 papers · 1 filter
Vertex-transitive Neumaier graphs
Mojtaba Jazaeri
A graph 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…
On -polynomial distance-regular graphs with a linear dependency involving a -clique
Mojtaba Jazaeri
Let denote a distance-regular graph with diameter . Let denote a primitive idempotent of with respect to which is -polynomial. Assume that there exists…
Neumaier Cayley graphs
Mojtaba Jazaeri
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 suffic…
Distance-regular graphs admitting a perfect -code
Mojtaba Jazaeri
In this paper, we study the problem that which of distance-regular graphs admit a perfect -code. Among other results, we characterize distance-regular line graphs which admit a…
Self-complementary distance-regular Cayley graphs over abelian groups
Mojtaba Jazaeri
In this paper, we study self-complementary distance-regular Cayley graphs over abelian groups. We prove that if a regular graph is self-complementary distance-regular, then it is s…
Distance-regular Cayley graphs with small valency
Edwin R. van Dam, Mojtaba Jazaeri
We consider the problem of which distance-regular graphs with small valency are Cayley graphs. We determine the distance-regular Cayley graphs with valency at most , the Cayley…