21 citations · 29 across the 10 of their papers we have counts for
Showing 2024Show all
2 papers · 1 filter
math.CO2024
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…
math.CO2024
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…