Loading...
Loading...

Go to the content (press return)

The degree/diameter problem in maximal planar bipartite graphs

Author
Dalfo, C.; Huemer, C.; Salas, J.
Type of activity
Journal article
Journal
Electronic notes in discrete mathematics
Date of publication
2014
Volume
46
First page
73
Last page
80
Repository
http://hdl.handle.net/2117/26448 Open in new window
Abstract
The (¿;D) (degree/diameter) problem consists of nding the largest possible number of vertices n among all the graphs with maximum degree ¿ and diameter D. We consider the (¿;D) problem for maximal planar bipartite graphs, that are simple planar graphs in which every face is a quadrangle. We obtain that for the (¿; 2) problem, the number of vertices is n = ¿+2; and for the (¿; 3) problem, n = 3¿¿1 if ¿ is odd and n = 3¿ ¿ 2 if ¿ is even. Then, we study the general case (¿;D) and obt...
Citation
Dalfo, C.; Huemer, C.; Salas, J. The degree/diameter problem in maximal planar bipartite graphs. "Electronic notes in discrete mathematics", 2014, vol. 46, p. 73-80.
Keywords
(¿, D) problem, maximal planar bipartite graphs
Group of research
COMBGRAPH - Combinatorics, Graph Theory and Applications
DCG - Discrete and Combinatorial Geometry

Participants

Attachments