Previous |  Up |  Next


[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
[2] F. R. K. CHUNG: Diameter of communication networks. 1985, Preprint. MR 0846852
[3] W. GOLOMB: Polyominoes. Scribner, New York, 1965.
[4] Sin-Min LEE K. C. NG: Every Young Tableau graph is d-graceful. Abstract of AMS 83T-05-266.
[5] Sin-Min LEE: Design of diameter edge-invariant networks. Preprint 1986.
[6] D. ORE: Diameter of Graphs. Journal of Combinatorics Theory 5 (1968), 75-81. MR 0227043
Partner of
EuDML logo