Breaking the symmetries of the book graph and the generalized Petersen graph
DOI10.1137/080728640zbMATH Open1207.05078OpenAlexW2077367194MaRDI QIDQ3583296FDOQ3583296
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
Recommendations
labelingautomorphism groupgeneralized Petersen graphdistinguishing chromatic numberdistinguishing numberbook graph
Coloring of graphs and hypergraphs (05C15) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Cited In (7)
- Labeling resolving sets
- Distinguishing numbers and distinguishing indices of oriented graphs
- Distinguishing chromatic numbers of complements of Cartesian products of complete graphs
- Nordhaus-Gaddum theorem for the distinguishing chromatic number
- Distinguishing and distinguishing chromatic numbers of generalized Petersen graphs
- Paint cost and the frugal distinguishing number
- Symmetry breaking in planar and maximal outerplanar graphs
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)