The distinguishing number of Cartesian products of complete graphs

From MaRDI portal
Publication:2427541

DOI10.1016/j.ejc.2007.11.018zbMath1205.05198OpenAlexW2081088856MaRDI QIDQ2427541

Wilfried Imrich, Janja Jerebic, Sandi Klavžar

Publication date: 13 May 2008

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2007.11.018




Related Items (27)

An upper bound on the distinguishing index of graphs with minimum degree at least twoExtending precolorings to distinguish group actionsDistinguishing graphs with intermediate growthDistinguishing number and distinguishing index of strong product of two graphsDistinguishing number of hierarchical products of graphsTrees with distinguishing number twoNordhaus-Gaddum theorem for the distinguishing chromatic numberDistinguishing threshold of graphsEndomorphism breaking in graphsList-distinguishing Cartesian products of cliquesDistinguishing numbers and distinguishing indices of oriented graphsA bound for the distinguishing index of regular graphsImproving upper bounds for the distinguishing indexDistinguishing graphs by edge-colouringsDistinguishing Cartesian products of countable graphsThe list distinguishing number equals the distinguishing number for interval graphsThe chromatic distinguishing index of certain graphsInfinite motion and 2-distinguishability of graphs and groupsDistinguishing colorings of Cartesian products of complete graphsThe distinguishing chromatic number of Cartesian products of two complete graphsOn the distinguishing number of cyclic tournaments: towards the Albertson-Collins conjectureDistinguishing chromatic numbers of complements of Cartesian products of complete graphsDistinguishing index of Kronecker product of two graphsThe determining number of a Cartesian productNordhaus-Gaddum type inequalities for the distinguishing indexNumber of distinguishing colorings and partitionsPrecise bounds for the distinguishing index of the Cartesian product



Cites Work




This page was built for publication: The distinguishing number of Cartesian products of complete graphs