Roghayeh Maleki

collaborators

7 papers

math.CO2024

On the $Q$ -polynomial property of the full bipartite graph of a Hamming graph

Blas Fernández, Roghayeh Maleki, Štefko Miklavič +1

The $Q$ -polynomial property is an algebraic property of distance-regular graphs, that was introduced by Delsarte in his study of coding theory. Many distance-regular graphs admit t…

math.CO2024

On the maximum intersecting sets of the general semilinear group of degree $2$

Roghayeh Maleki, Andriaherimanana Sarobidy Razafimahatratra

Let $p$ be a prime and $q = p^{k}$ . A subset $F \subset ΓL_{2} (q)$ is intersecting if any two semilinear transformations in $F$ agree on some non-z…

math.CO2023

On the Terwilliger algebra of the group association scheme of $C_{n} ⋊ C_{2}$

Roghayeh Maleki

In 1992, Terwilliger introduced the notion of the \emph{Terwilliger algebra} in order to study association schemes. The Terwilliger algebra of an association scheme $A$ i…

math.CO2023

The Erdős-Ko-Rado Theorem for non-quasiprimitive groups of degree $3 p$

Roghayeh Maleki, Andriaherimanana Sarobidy Razafimahatratra

The \emph{intersection density} of a finite transitive group $G \leq Sym (Ω)$ is the rational number $ρ (G)$ given by the ratio between the maximum size of a subset of…

math.CO2023

Distance-regular graphs with classical parameters that support a uniform structure: case $q \geq 2$

Blas Fernández, Roghayeh Maleki, Štefko Miklavič +1

Let $Γ = (X, R)$ denote a finite, simple, connected, and undirected non-bipartite graph with vertex set $X$ and edge set $R$ . Fix a vertex $x \in X$ , and define $\…

math.CO2023

The $q$ -Analogue of Zero Forcing for Certain Families of Graphs

Shaun Fallat, Neha Joshi, Roghayeh Maleki +6

Zero forcing is a combinatorial game played on a graph with the ultimate goal of changing the colour of all the vertices at minimal cost. Originally this game was conceived as a on…

On the Q-polynomial property of the full bipartite graph of a Hamming graph

On the maximum intersecting sets of the general semilinear group of degree 2

On the Terwilliger algebra of the group association scheme of Cn​⋊C2​

The Erdős-Ko-Rado Theorem for non-quasiprimitive groups of degree 3p

Distance-regular graphs with classical parameters that support a uniform structure: case q≥2

The q-Analogue of Zero Forcing for Certain Families of Graphs

On the $Q$ -polynomial property of the full bipartite graph of a Hamming graph

On the maximum intersecting sets of the general semilinear group of degree $2$

On the Terwilliger algebra of the group association scheme of $C_{n} ⋊ C_{2}$

The Erdős-Ko-Rado Theorem for non-quasiprimitive groups of degree $3 p$

Distance-regular graphs with classical parameters that support a uniform structure: case $q \geq 2$

The $q$ -Analogue of Zero Forcing for Certain Families of Graphs