S. Mirafzal

activity

20112025

most citedSome algebraic properties of bipartite Kneser graphs

7 citations · 15 across the 14 of their papers we have counts for

collaborators

16 papers

math.CO2025

The distance spectrum of the bipartite double cover of strongly regular graphs

S. Morteza Mirafzal

A strongly regular graph with parameters $(n, d, a, c)$ is a $d$ -regular graph of order $n$ , in which every pair of adjacent vertices has exactly $a$ common neighbor(s) and every pair…

math.CO2025

The distance spectrum of the line graph of the crown graph

S. Morteza Mirafzal

The distance eigenvalues of a connected graph $G$ are the eigenvalues of its distance matrix $D (G)$ . A graph is called distance integral if all of its distance eigenvalues are inte…

math.CO2024

Automorphism group of a family of distance regular graphs which are not distance transitive

Angsuman Das, S. Morteza Mirafzal

Let $G_{n} = Z_{n} \times Z_{n}$ for $n \geq 4$ and $S = {(i, 0), (0, i), (i, i) : 1 \leq i \leq n - 1} \subset G_{n}$ . Define $Γ (n)$ to be the Cayley graph of $G_{n}$ with respect to th…

math.CO2021

On the distance eigenvalues of design graphs

S. Morteza Mirafzal

A design graph is a regular bipartite graph in which any two distinct vertices of the same part have the same number of common neighbors. This class of graphs have a close relation…

math.CO2021

$L (n)$ graphs are vertex-pancyclic and Hamilton-connected

S. Morteza Mirafzal, Sara Kouhi

A graph $G$ of order $n > 2$ is pancyclic if $G$ contains a cycle of length $l$ for each integer $l$ with $3 \leq l \leq n$ and it is called vertex-pancyclic if every vertex is cont…

math.CO2021

The automorphism group of the Andrásfai graph

S. Morteza Mirafzal

Let $k \geq 1$ be an integer and $n = 3 k - 1$ . Let $Z_{n}$ denote the additive group of integers modulo $n$ and let $C$ be the subset of $Z_{n}$ consisting of the element…

The distance spectrum of the bipartite double cover of strongly regular graphs

The distance spectrum of the line graph of the crown graph

Automorphism group of a family of distance regular graphs which are not distance transitive

On the distance eigenvalues of design graphs

L(n) graphs are vertex-pancyclic and Hamilton-connected

The automorphism group of the Andrásfai graph

$L (n)$ graphs are vertex-pancyclic and Hamilton-connected