5 citations · 5 across the 4 of their papers we have counts for
4 papers
On Dynamic Coloring of Graphs
Meysam Alishahi
A dynamic coloring of a graph is a proper coloring such that for every vertex of degree at least 2, the neighbors of receive at least 2 colors. In this paper we…
Circular Coloring and Mycielski Construction
Meysam Alishahi, Hossein Hajiabolhassan
In this paper, we investigate circular chromatic number of Mycielski construction of graphs. It was shown in \cite{MR2279672} that Mycielskian of the Kneser graph $KG(…
A Generalization of the Erdös-Ko-Rado Theorem
Meysam Alishahi, Hossein Hajiabolhassan, Ali Taherkhani
In this note, we investigate some properties of local Kneser graphs defined in [8]. In this regard, as a generalization of the Erds-Ko-Rado theorem, we characterize…
A Note on Chromatic Sum
Meysam Alishahi, Ali Taherkhani
The chromatic sum of a graph is the smallest sum of colors among of proper coloring with the natural number. In this paper, we introduce a necessary condition for the ex…