Journal
SIAM JOURNAL ON DISCRETE MATHEMATICS
Volume 27, Issue 2, Pages 1106-1111Publisher
SIAM PUBLICATIONS
DOI: 10.1137/110855089
Keywords
rainbow graph; switching class; Seidel matrix; Eulerian graph; two graph; parallelotopic graph; neighbor-complete coloring
Categories
Funding
- National Research Foundation of Korea
- Samsung Scholarship
Ask authors/readers for more resources
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available
Share Paper
