|
| |
|
|
A374261
|
|
Edge-distinguishing chromatic number of the triangular ladder graph with n vertices.
|
|
0
|
|
|
|
3, 4, 5, 5, 6, 7, 7, 7, 8, 9, 9, 9, 10, 10, 10, 10, 10, 10, 10, 11
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
3,1
|
|
|
REFERENCES
|
O. Frank, F. Harary, and M. J. Plantholt, The line-distinguishing chromatic number of a graph, pp. 14, 241-252 of Ars Combinatoria (1982).
|
|
|
LINKS
|
K. Al-Wahabi, R. Bari, F. Harary and D. Ullman, The edge-distinguishing chromatic number of paths and cycles, pp. 17-22 of Graph Theory in Memory of G. A. Dirac (Sandbjerg, 1985). Edited by L. D. Andersen et al., Annals of Discrete Mathematics, 41. North-Holland Publishing Co., Amsterdam-New York, 1989.
|
|
|
EXAMPLE
|
The first few triangular ladder graphs are illustrated below:
o o---o o---o o---o---o
/ \ / \ / / \ / \ / \ / \ /
o---o o---o o---o---o o---o---o
|
|
|
CROSSREFS
|
|
|
|
KEYWORD
|
nonn,more
|
|
|
AUTHOR
|
|
|
|
STATUS
|
approved
|
| |
|
|
