Rainbow graphs and switching classes

DOI10.1137/110855089MaRDI QIDQ2848559zbMATH OpenOpenAlexFDO

Authors Suho Oh, Hwanchul Yoo, Taedong Yun

Publication date 26 September 2013

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1108.6143, http://hdl.handle.net/1721.1/80376

zbMATH Keywords

Eulerian graphneighbor-complete coloringparallelotopic graphrainbow graphSeidel matrixswitching classtwo graph

Mathematics Subject Classification ID

Combinatorial identities, bijective combinatorics (05A19) Coloring of graphs and hypergraphs (05C15) Enumeration in graph theory (05C30) Group actions on combinatorial structures (05E18)

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.

Recommendations

• scientific article; zbMATH DE number 1867241
• Rainbow graphs and semigroups
• The \(r\)-switching-stable graphs
• Switching with more than two colours.
• Rainbow partitions and rainbow polynomial

Cited in

(6)

• The \(r\)-switching-stable graphs
• scientific article; zbMATH DE number 1867241 (Why is no real title available?)
• Rainbow graphs and semigroups
• Switching classes: characterization and computation
• Rainbow independent sets on dense graph classes
• Rainbow tetrahedra in Cayley graphs

This page was built for publication: Rainbow graphs and switching classes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2848559)