Mojtaba Jazaeri

collaborators

2 papers

math.CO2025

Vertex-transitive Neumaier graphs

Mojtaba Jazaeri

A graph $I^$ 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 cliqu…

math.CO2025

On $Q$ -polynomial distance-regular graphs with a linear dependency involving a $3$ -clique

Mojtaba Jazaeri

Let $I^$ denote a distance-regular graph with diameter $D \geq 2$ . Let $E$ denote a primitive idempotent of $I^$ with respect to which $I^$ is $Q$ -polynomial. Assume that there exi…

Vertex-transitive Neumaier graphs

On Q-polynomial distance-regular graphs with a linear dependency involving a 3-clique

On $Q$ -polynomial distance-regular graphs with a linear dependency involving a $3$ -clique