3 papers
math.CO2026
Intersection Arrays of Completely Regular Codes of Covering Radius One in Generalized Petersen Graphs
Hamed Karami
We determine all possible intersection arrays of completely regular codes of covering radius one in the generalized Petersen graphs \(GP(n,k)\), where \(n\geq 3\) and \(1\leq k<n/2…
math.CO2024
Distance-balancing of cube-connected cycles graphs
Mokhtar Aouina, Hamed Karami, Douglas J. LaFountain
We show that cube-connected cycles graphs are distance-balanced, and nicely distance-balanced if and only if is even.
math.CO2020
Perfect 2-colorings of the generalized Petersen graph GP(n,3)
Hamed Karami
In this paper we enumerate the parameter matrices of all perfect 2-colorings of the generalized Petersen graphs GP(n;3), where n>=7. We also give some basic results for GP(n; k).