Rainbow Graphs and Switching Classes
Combinatorics
2020-09-01 v3
Abstract
A rainbow graph is a graph that admits a vertex-coloring such that every color appears exactly once in the neighborhood of each vertex. We investigate some properties of rainbow graphs. In particular, we show that there is a bijection between the isomorphism classes of n-rainbow graphs on 2n vertices and the switching classes of graphs on n vertices.
Cite
@article{arxiv.1108.6143,
title = {Rainbow Graphs and Switching Classes},
author = {Suho Oh and Hwanchul Yoo and Taedong Yun},
journal= {arXiv preprint arXiv:1108.6143},
year = {2020}
}
Comments
Added more reference, fixed some typos (revision for journal submission)