The Diameter of undirected graphs associated to plane tessellations

Thi s paper studi es the di ameter of sorne fami I i es of undirected graphs that can be associated to plane tessel lations which fu1 ly represent them. More precisely, we concentrate upon maximizing the order of the graphs for given values of their diameter and degree, where the study always leads to the optima'l solutions.