| Title:
|
Three classes of diameter edge-invariant graphs (English) |
| Author:
|
Lee, Sin Min |
| Author:
|
Tanoto, Rudy |
| Language:
|
English |
| Journal:
|
Commentationes Mathematicae Universitatis Carolinae |
| ISSN:
|
0010-2628 (print) |
| ISSN:
|
1213-7243 (online) |
| Volume:
|
28 |
| Issue:
|
2 |
| Year:
|
1987 |
| Pages:
|
227-232 |
| . |
| Category:
|
math |
| . |
| MSC:
|
05B50 |
| MSC:
|
05C35 |
| MSC:
|
05C38 |
| MSC:
|
05C75 |
| MSC:
|
05C99 |
| idZBL:
|
Zbl 0627.05041 |
| idMR:
|
MR904748 |
| . |
| Date available:
|
2008-06-05T21:28:45Z |
| Last updated:
|
2012-04-28 |
| Stable URL:
|
http://hdl.handle.net/10338.dmlcz/106535 |
| . |
| Reference:
|
[1] J. C. BERMOND J. BOND A. PAOLI C. PEYRAT: Graphs and interconnection networks: diameter and vulnerability.London Math. Soc. Lecture Note No. 82, Cambridge Univ. Press 1983, 1-30. MR 0721179 |
| Reference:
|
[2] F. R. K. CHUNG: Diameter of communication networks.1985, Preprint. MR 0846852 |
| Reference:
|
[3] W. GOLOMB: Polyominoes.Scribner, New York, 1965. |
| Reference:
|
[4] Sin-Min LEE K. C. NG: Every Young Tableau graph is d-graceful.Abstract of AMS 83T-05-266. |
| Reference:
|
[5] Sin-Min LEE: Design of diameter edge-invariant networks.Preprint 1986. |
| Reference:
|
[6] D. ORE: Diameter of Graphs.Journal of Combinatorics Theory 5 (1968), 75-81. MR 0227043 |
| . |
