Sciweavers

26 search results - page 1 / 6
» Distinguishing Cartesian powers of graphs
Sort
View
61
Voted
JGT
2006
52views more  JGT 2006»
14 years 10 months ago
Distinguishing Cartesian powers of graphs
Wilfried Imrich, Sandi Klavzar
84
Voted
DM
2010
117views more  DM 2010»
14 years 10 months ago
The distinguishing chromatic number of Cartesian products of two complete graphs
A labeling of a graph G is distinguishing if it is only preserved by the trivial automorphism of G. The distinguishing chromatic number of G is the smallest integer k such that G ...
Janja Jerebic, Sandi Klavzar
85
Voted
EJC
2008
14 years 10 months ago
The distinguishing number of Cartesian products of complete graphs
The distinguishing number D(G) of a graph G is the least integer d such that G has a labeling with d labels that is preserved only by a trivial automorphism. We prove that Cartesi...
Wilfried Imrich, Janja Jerebic, Sandi Klavzar
DM
2008
77views more  DM 2008»
14 years 10 months ago
Distinguishing colorings of Cartesian products of complete graphs
Michael J. Fisher, Garth Isaak
SIAMDM
2010
133views more  SIAMDM 2010»
14 years 8 months ago
Distinguishing Chromatic Number of Cartesian Products of Graphs
Jeong Ok Choi, Stephen G. Hartke, Hemanshu Kaul