Breaking the symmetries of the book graph and the generalized Petersen graph

DOI10.1137/080728640MaRDI QIDQ3583296zbMATHOpenAlexFDO

Authors

Publication date 27 August 2010

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

Full work available at URL https://doi.org/10.1137/080728640

zbMATH Keywords

labelingautomorphism groupgeneralized Petersen graphdistinguishing chromatic numberdistinguishing numberbook graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Recommendations

• Distinguishing and distinguishing chromatic numbers of generalized Petersen graphs
• Symmetry breaking in graphs
• Distinguishing numbers and distinguishing indices of oriented graphs
• The distinguishing chromatic number of line graphs of complete graphs
• Distinguishing numbers for graphs and groups

Cited in

(7)

• Paint cost and the frugal distinguishing number
• Symmetry breaking in planar and maximal outerplanar graphs
• Distinguishing numbers and distinguishing indices of oriented graphs
• Labeling resolving sets
• Distinguishing and distinguishing chromatic numbers of generalized Petersen graphs
• Distinguishing chromatic numbers of complements of Cartesian products of complete graphs
• Nordhaus-Gaddum theorem for the distinguishing chromatic number

This page was built for publication: Breaking the symmetries of the book graph and the generalized Petersen graph

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