Six signed Petersen graphs, and their automorphisms

DOI10.1016/j.disc.2011.12.010zbMath1239.05086arXiv1303.3347OpenAlexW1994722261MaRDI QIDQ411664

Thomas Zaslavsky

Publication date: 30 April 2012

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1303.3347

zbMATH Keywords

clusterabilitysigned graphswitchingPetersen graphfrustrationbalanceproper graph coloringswitching automorphism

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Signed and weighted graphs (05C22)

Related Items

Non-isomorphic signatures on some generalised Petersen graph ⋮ SIGNED COMPLETE GRAPHS ON SIX VERTICES AND THEIR FRUSTRATION INDICES ⋮ The number of switching isomorphism classes of signed graphs associated with particular graphs ⋮ Unnamed Item ⋮ Open problems in the spectral theory of signed graphs

Cites Work

• Correlation clustering
• Biased graphs. I: Bias, balance, and gains
• Signed graphs
• Signed graph coloring
• Chromatic invariants of signed graphs
• Inside-out polytopes
• On the notion of balance of a signed graph
• Characterizations of signed graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Six signed Petersen graphs, and their automorphisms