Title of article
Largest planar graphs and largest maximal planar graphs of diameter two
Author/Authors
Yang، نويسنده , , Yuansheng and Lin، نويسنده , , Jianhua and Dai، نويسنده , , Yongjie، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2002
Pages
10
From page
349
To page
358
Abstract
Let fk(Δ) be the maximum number of vertices in a planar graph with diameter k and maximum degree Δ. Let gk(Δ) be the maximum number of vertices in a maximal planar graph with diameter k and maximum degree Δ. Seyffarth has shown that g2(Δ)=⌊3Δ/2+1⌋ for Δ⩾8. Hell and Seyffarth have shown that f2(Δ)=⌊3Δ/2+1⌋ for Δ⩾8. We compute the exact maximum number of vertices in a planar graph and a maximal planar graph with diameter two and maximum degree Δ, for Δ<8.
Keywords
Planar graph , maximum degree , maximal planar graph
Journal title
Journal of Computational and Applied Mathematics
Serial Year
2002
Journal title
Journal of Computational and Applied Mathematics
Record number
1551814
Link To Document