Distinguishing numbers of Cartesian products of multiple complete graphs

DOI10.26493/1855-3974.245.348zbMATH Open1244.05185OpenAlexW2131259888WikidataQ129355091 ScholiaQ129355091MaRDI QIDQ2892016FDOQ2892016

Authors: Michael J. Fisher, Garth Isaak 

Publication date: 18 June 2012

Published in: Ars Mathematica Contemporanea (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.26493/1855-3974.245.348

Recommendations

• The distinguishing number of Cartesian products of complete graphs
• Distinguishing colorings of Cartesian products of complete graphs
• Distinguishing Cartesian products of countable graphs
• The distinguishing chromatic number of Cartesian products of two complete graphs
• Distinguishing chromatic number of Cartesian products of graphs

zbMATH Keywords

Cartesian productcomplete graphdistinguishing number

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph operations (line graphs, products, etc.) (05C76) Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25)

Cited In (7)

• Distinguishing colorings of Cartesian products of complete graphs
• Zombie number of the Cartesian product of graphs
• The distinguishing number of Cartesian products of complete graphs
• Distinguishing number of hierarchical products of graphs
• Title not available (Why is that?)
• Distinguishing graphs with intermediate growth
• Cartesian powers of graphs can be distinguished by two labels

This page was built for publication: Distinguishing numbers of Cartesian products of multiple complete graphs

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