8 citations · 11 across the 14 of their papers we have counts for
Showing 2018Show all
3 papers · 1 filter
math.CO2018
A note on b-coloring of Kneser graphs
Saeed Shaebani
In this short note, the purpose is to provide an upper bound for the b-chromatic number of Kneser graphs. Our bound improves the upper bound that was presented by Balakrishnan and…
math.CO2018
On Local Antimagic Chromatic Number of Graphs
Saeed Shaebani
A {\it local antimagic labeling} of a connected graph with at least three vertices, is a bijection such that for any two adjacent v…
math.CO2018
On The Circular Altitude of Graphs
Saeed Shaebani
Peter Cameron introduced the concept of the circular altitude of graphs; a parameter which was shown by Bamberg et al. that provides a lower bound on the circular chromatic number.…