Carregant...
Carregant...

Vés al contingut (premeu Retorn)

The degree/diameter problem in maximal planar bipartite graphs

Autor
Dalfo, C.; Huemer, C.; Salas, J.
Tipus d'activitat
Article en revista
Revista
Electronic notes in discrete mathematics
Data de publicació
2014
Volum
46
Pàgina inicial
73
Pàgina final
80
Repositori
http://hdl.handle.net/2117/26448 Obrir en finestra nova
Resum
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...
Citació
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.
Paraules clau
(¿, Maximal Planar Bipartite Graphs, d) Problem
Grup de recerca
COMBGRAPH - Combinatòria, Teoria de Grafs i Aplicacions
DCG - Discrete and Combinatorial Geometry

Participants

Arxius