Geodesic
Distinguishing numbers of Cartesian products of multiple complete graphs
Ars mathematica contemporanea, Volume 5 (2012) no. 1, pp. 159-173

See the original article notice from the Ars Mathematica Contemporanea website source

We examine the distinguishing number of the Cartesian product of an arbitrary number of complete graphs. We show that for u1 ≤ ... ≤ ud the distinguishing number of the Cartesian product of complete graphs of these sizes is either ⌈ud1/s⌉ or ⌈ud1/s⌉ + 1 where s = Πi = 1d − 1 ui. In most cases, which of these values it is can be explicitly determined. 
Michael J. Fisher; Garth Isaak. Distinguishing numbers of Cartesian products of multiple complete graphs. Ars mathematica contemporanea, Volume 5 (2012) no. 1, pp. 159-173. doi: 10.26493/1855-3974.245.348
@article{10_26493_1855_3974_245_348,
     author = {Michael J. Fisher and Garth Isaak},
     title = {
		{Distinguishing} numbers of {Cartesian} products of multiple complete graphs
	},
     journal = {Ars mathematica contemporanea},
     pages = {159--173},
     year = {2012},
     volume = {5},
     number = {1},
     doi = {10.26493/1855-3974.245.348},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.26493/1855-3974.245.348/}
}
TY  - JOUR
AU  - Michael J. Fisher
AU  - Garth Isaak
TI  - Distinguishing numbers of Cartesian products of multiple complete graphs
	
JO  - Ars mathematica contemporanea
PY  - 2012
SP  - 159
EP  - 173
VL  - 5
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.26493/1855-3974.245.348/
DO  - 10.26493/1855-3974.245.348
LA  - en
ID  - 10_26493_1855_3974_245_348
ER  - 
%0 Journal Article
%A Michael J. Fisher
%A Garth Isaak
%T Distinguishing numbers of Cartesian products of multiple complete graphs
	
%J Ars mathematica contemporanea
%D 2012
%P 159-173
%V 5
%N 1
%U http://geodesic.mathdoc.fr/articles/10.26493/1855-3974.245.348/
%R 10.26493/1855-3974.245.348
%G en
%F 10_26493_1855_3974_245_348

Cited by Sources: