Loading...
Loading...

Go to the content (press return)

The degree-diameter problem in maximal bipartite planar graphs

Author
Dalfo, C.; Huemer, C.; Salas, J.
Type of activity
Presentation of work at congresses
Name of edition
IX Jornadas de Matemática Discreta y Algorítmica
Date of publication
2014
Presentation's date
2014-07
Book of congress proceedings
IX Jornadas de Matemática Discreta y Algorítmica : Tarragona, 7-9 de Julio de 2014
First page
271
Last page
279
Repository
http://hdl.handle.net/2117/24097 Open in new window
URL
http://deim.urv.cat/~discrete-math/JMDA2014/programme.html Open in new window
Abstract
The (A ,D) (degree/diameter) problem consists of finding the largest possible number of vertices n among all the graphs with maximum degree and diameter D. We consider the (A ,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 ( A ,D) and obtain tha...
Citation
Dalfo, C.; Huemer, C.; Salas, J. The degree-diameter problem in maximal bipartite planar graphs. A: Jornadas de Matemática Discreta y Algorítmica. "IX Jornadas de Matemática Discreta y Algorítmica : Tarragona, 7-9 de Julio de 2014". Tarragona: 2014, p. 271-279.
Keywords
Maximal planar bipartite graphs
Group of research
COMBGRAPH - Combinatorics, Graph Theory and Applications
DCG - Discrete and Combinatorial Geometry

Participants

Attachments