Roghayeh Maleki

activity

20202026

collaborators

Showing 2023Show all

8 papers · 1 filter

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

Parameters of Quotient-Polynomial Graphs

Allen Herman, Roghayeh Maleki

Fiol has characterized quotient-polynomial graphs as precisely the connected graphs whose adjacency matrix generates the adjacency algebra of a symmetric association scheme. We sho…

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

On cocliques in commutative Schurian association schemes of the symmetric group

Roghayeh Maleki, Andriaherimanana Sarobidy Razafimahatratra

Given the symmetric group $G = Sym (n)$ and a multiplicity-free subgroup $H \leq G$ , the orbitals of the action of $G$ on $G / H$ by left multiplication induce a commuta…

math.CO2023

On the intersection spectrum of $PSL_{2} (q)$

Angelot Behajaina, Roghayeh Maleki, Andriaherimanana Sarobidy Razafimahatratra

Given a group $G$ and a subgroup $H \leq G$ , a set $F \subset G$ is called $H$ \emph{-intersecting} if for any $g, g^{'} \in F$ , there exists $x H \in G / H$ such that $…

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…

math.CO2023

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

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 $\…

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

Parameters of Quotient-Polynomial Graphs

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

On cocliques in commutative Schurian association schemes of the symmetric group

On the intersection spectrum of PSL2​(q)

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

Distance-regular graphs with classical parameters that support a uniform structure: case q≤1

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$

On the intersection spectrum of $PSL_{2} (q)$

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

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