7 papers
Regular sets of circulant quartic graphs
A. Abdollahi, J. Bagherian, F. Jafari +3
For a graph and nonnegative integers and , a nonempty proper subset is called an -regular set if every vertex in has exactly neighbors…
Improved bounds on the size of permutation codes under Kendall -metric
Farzad Parvaresh, Reza Sobhani, Alireza Abdollahi +3
In order to overcome the challenges caused by flash memories and also to protect against errors related to reading information stored in DNA molecules in the shotgun sequencing met…
New Upper Bounds on the Size of Permutation Codes under Kendall -Metric
Alireza Abdollahi, Javad Bagherian, Fatemeh Jafari +3
We first give two methods based on the representation theory of symmetric groups to study the largest size of permutation codes of length i.e. subsets of the set …
New Bounds on the Size of Permutation Codes With Minimum Kendall -distance of Three
A. Abdollahi, J. Bagherian, F. Jafari +3
We study , the size of the largest subset of the set of all permutations with minimum Kendall -distance . Using a combination of group theory and integer progra…
Regular character-graphs whose eigenvalues are greater than or equal to -2
Mahdi Ebrahimi, Maryam Khatami, Zohreh Mirzaei
Let be a finite group and be the set of all complex irreducible characters of . The character-graph associated to , is a graph whose vertex set i…
On the multiplicities of the character codegrees
Zeinab Akhlaghi, Mehdi Ebrahimi, Maryam Khatami
Let G be a finite group and ? be an irreducible character of G, the number cod(?) = jG : Let be a finite group and be an irreducible character of , the number $ \co…
A conjecture of Cameron and Kiyota on sharp characters with prescribed values
A. Abdollahi, J. Bagherian, M. Khatami +2
Let be a virtual (generalized) character of a finite group and be the image of on . The pair is said to be sharp of type…