Name
Abstract | ||
|---|---|---|
We examine the distinguishing number of the Cartesian product of an arbitrary number of complete graphs. We show that for u(1) <= ... <= u(d) the distinguishing number of the Cartesian product of complete graphs of these sizes is either inverted right perpendicularu(d)(1/s)inverted left perpendicular or inverted right perpendicularu(d)(1/s)inverted left perpendicular + 1 where s - Pi(d-1)(i=1)u(i). In most cases, which of these values it is can be explicitly determined. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.26493/1855-3974.245.348 | ARS MATHEMATICA CONTEMPORANEA |
Keywords | Field | DocType |
Cartesian product,complete graph,distinguishing number | Graph,Discrete mathematics,Combinatorics,Cartesian product,Mathematics,U-1 | Journal |
Volume | Issue | ISSN |
5 | 1 | 1855-3966 |
Citations | PageRank | References |
1 | 0.37 | 6 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| michael j fisher | 1 | 1 | 0.37 |
| Garth Isaak | 2 | 172 | 24.01 |