×

Largest planar graphs of diameter two and fixed maximum degree. (English) Zbl 0837.05074

Summary: We compute the exact maximum number of vertices in a planar graph with diameter two and maximum degree \(\Delta\), for any \(\Delta \geq 8\). Results for larger diameter are also mentioned.

MSC:

05C35 Extremal problems in graph theory
05C10 Planar graphs; geometric and topological aspects of graph theory
05C38 Paths and cycles
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Bermond, J-C.; Delorme, C.; Quisquater, J.-J., Strategies for interconnection networks: some methods from graph theory, J. Parallel and Distributed Comput., 3, 433-449 (1986)
[2] Bondy, J. A.; Murty, U. S.R., Graph Theory with Applications (1976), Elsevier: Elsevier New York · Zbl 1134.05001
[3] Special Double Volume, Interconnection Networks, (Bermond, J-C., DAMIN, Discrete Appl. Math. (1992)), 37/38
[4] Delorme, C., Large bipartite graphs with given degree and diameter, J. Graph Theory, 9, 325-334 (1985) · Zbl 0623.05048
[5] M. Fellows, P. Hell and K. Seyffarth, Large planar graphs with given diameter and maximum degree, to appear.; M. Fellows, P. Hell and K. Seyffarth, Large planar graphs with given diameter and maximum degree, to appear. · Zbl 0832.05060
[6] Seyffarth, K., Maximal planar graphs of diameter two, J. Graph Theory, 13, 619-648 (1989) · Zbl 0702.05048
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.