Bahman Ahmadi

activity

20112024

most citedThe Erdős-Ko-Rado property for some permutation groups

11 citations · 36 across the 11 of their papers we have counts for

collaborators

12 papers

quant-ph2024

A generalization of quantum pair state transfer

Sooyeong Kim, Hermie Monterde, Bahman Ahmadi +3

An $s$ -pair state in a graph is a quantum state of the form $e_{u} + s e_{v}$ , where $u$ and $v$ are vertices in the graph and $s$ is a non-zero complex number. If $s=-1…

math.CO2021★ 2 cited

Distinguishing threshold for some graph operations

Mohammad Hadi Shekarriz, Seyed Alireza Talebpour Shirazi Fard, Bahman Ahmadi +2

A vertex coloring of a graph $G$ is distinguishing if non-identity automorphisms do not preserve it. The distinguishing number, $D (G)$ , is the minimum number of colors required for…

math.CO2021★ 5 cited

Distinguishing threshold of graphs

Mohammad Hadi Shekarriz, Bahman Ahmadi, Seyed Alireza Talebpour Shirazi Fard +1

A vertex coloring of a graph $G$ is called distinguishing if no non-identity automorphisms of $G$ can preserve it. The distinguishing number of $G$ , denoted by $D (G)$ , is the minim…

math.CO2019★ 10 cited

Number of Distinguishing Colorings and Partitions

Bahman Ahmadi, Fatemeh Alinaghipour, Mohammad Hadi Shekarriz

A vertex coloring of a graph $G$ is called distinguishing (or symmetry breaking) if no non-identity automorphism of $G$ preserves it, and the distinguishing number, shown by $D (G)$ …

math.CO2017

Perfect quantum state transfer on the Johnson scheme

Bahman Ahmadi, M. H. Shirdareh Haghighi, Ahmad Mokhtar

For any graph $X$ with the adjacency matrix $A$ , the transition matrix of the continuous-time quantum walk at time $t$ is given by the matrix-valued function $\mathcal{H}_X(t)=\mat…

math.CO2017

A note on perfect quantum state transfers on trees

Bahman Ahmadi, Ahmad Mokhtar

It has been asked whether there are trees other than $P_{2}$ and $P_{3}$ which can admit perfect state transfers. In this note we show that the answer is negative.

math.CO2013★ 8 cited

Maximum Intersecting Families of Permutations

Bahman Ahmadi

It was first shown by Cameron and Ku that the group $G = S y m (n)$ has the strict EKR property. Then Godsil and Meagher presented an entirely different proof of this fact using some al…

math.CO2013★ 11 cited

The Erdős-Ko-Rado property for some permutation groups

Bahman Ahmadi, Karen Meagher

A subset in a group $G \leq S y m (n)$ is intersecting if for any pair of permutations $π, σ$ in the subset there is an $i \in {1, 2, \dots, n}$ such that $π (i) = σ (i)$ . If the stabiliz…

math.CO2013

The Erdős-Ko-Rado property for some 2-transitive groups

Bahman Ahmadi, Karen Meagher

A subset of a group G of Sym(n) is intersecting if for any pair of permutations $π, σ \in G$ there is an $i$ in {1,2,...,n} such that $π (i) = σ (i)$ . It has been shown, using an algeb…

math.CO2013

Minimum number of distinct eigenvalues of graphs

Bahman Ahmadi, Fatemeh Alinaghipour, Michael S. Cavers +3

The minimum number of distinct eigenvalues, taken over all real symmetric matrices compatible with a given graph $G$ , is denoted by $q (G)$ . Using other parameters related to $G$ , b…

math.CO2013

A new proof for the Erdős-Ko-Rado Theorem for the alternating group

Bahman Ahmadi, Karen Meagher

A subset $S$ of the alternating group on $n$ points is {\it intersecting} if for any pair of permutations $π, σ$ in $S$ , there is an element $i \in {1, \dots, n}$ such that $π(i)=σ(i…

math.SP2011

The minimum rank of universal adjacency matrices

Bahman Ahmadi, Fatemeh Alinaghipour, Shaun M. Fallat +3

In this paper we introduce a new parameter for a graph called the {\it minimum universal rank}. This parameter is similar to the minimum rank of a graph. For a graph $G$ the minimu…