Rainbow Graphs and Switching Classes

Author(s)
Oh, Suho; Yoo, Hwanchul; Yun, Taedong
Thumbnail
DownloadOh-2013-Rainbow graphs and switching classes.pdf (256Kb)
PUBLISHER_POLICY
Terms of use
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Metadata
Show full item record
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.
Date issued
2013-06
URI
http://hdl.handle.net/1721.1/80376
Department
Massachusetts Institute of Technology. Department of Mathematics
Journal
SIAM Journal on Discrete Mathematics
Publisher
Society for Industrial and Applied Mathematics
Citation
Oh, Suho, Hwanchul Yoo, and Taedong Yun. “Rainbow Graphs and Switching Classes.” SIAM Journal on Discrete Mathematics 27, no. 2 (April 4, 2013): 1106-1111. © 2013, Society for Industrial and Applied Mathematics
Version: Final published version
ISSN
0895-4801
1095-7146
Collections