2016/01/20 by Edouard Bonnet, Bonnet, Edouard, Florian Sikora +1
Computer Science · Mathematics · #Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #cs.DM #math.CO
paper · pdf · doi:10.48550/arxiv.1601.05190
Accepted in International Journal of Foundations of Computer Science
arxiv created 2016/01/20 · arxiv updated 2016/01/21
This note resolves an open problem asked by Bezrukov in the open problem session of IWOCA 2014. It shows an equivalence between regular graphs and graphs for which a sequence of invariants presents some symmetric property. We extend this result to a few other sequences.