Sciweavers

Share
44 search results - page 1 / 9
» The distinguishing number of Cartesian products of complete ...
Sort
View
EJC
2008
10 years 1 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
2010
117views more  DM 2010»
10 years 1 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
SIAMDM
2010
133views more  SIAMDM 2010»
9 years 11 months ago
Distinguishing Chromatic Number of Cartesian Products of Graphs
Jeong Ok Choi, Stephen G. Hartke, Hemanshu Kaul
GC
2008
Springer
10 years 1 months ago
On the Acyclic Chromatic Number of Hamming Graphs
An acyclic coloring of a graph G is a proper coloring of the vertex set of G such that G contains no bichromatic cycles. The acyclic chromatic number of a graph G is the minimum nu...
Robert E. Jamison, Gretchen L. Matthews
books