Mulder, Henry Martyn \((0,\lambda)\)-graphs and \(n\)-cubes. (English) Zbl 0418.05034 Discrete Math. 28, 179-188 (1979). Reviewer: J. W. Moon Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 5 ReviewsCited in 22 Documents MSC: 05C35 Extremal problems in graph theory 05C38 Paths and cycles Keywords:graph; diameter; degree PDFBibTeX XMLCite \textit{H. M. Mulder}, Discrete Math. 28, 179--188 (1979; Zbl 0418.05034) Full Text: DOI References: [1] Bondy, A.; Murty, U. S.R., Graph Theory with Applications (1976), Macmillan: Macmillan London · Zbl 1226.05083 [2] Foldes, S., A characterization of hypercubes, Discrete Mathematics, 17, 155-159 (1977) · Zbl 0354.05045 [3] Hanani, H., On transversal designs, (Hall, M.; van Lint, J. H., Combinatorics: Part I. Combinatorics: Part I, Mathematical Centre Tract, 55 (1974), Mathematical Centre: Mathematical Centre Amsterdam), 42-52 · Zbl 0312.05016 [4] Ryser, H. J., Combinatorial mathematics, (Carus Mathematical Monograph No. 14 (1963), Amer. Math. Assoc: Amer. Math. Assoc Providence, RI) · Zbl 0112.24806 [5] Seidel, J. J., Strongly regular graphs with (−1,1,0) adjacency matrix having eigenvalues 3, Linear Algebra and its Appl., 1, 281-298 (1968) · Zbl 0159.25403 This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.