270 search results - page 3 / 54 » Diameter bounds for planar graphs |
ARSCOM
2005
14 years 11 months ago
2005
We investigate the supereulerian graph problems within planar graphs, and we prove that if a 2-edge-connected planar graph G is at most three edges short of having two edge-disjoi...
116
click to vote
CORR
2011
Springer
14 years 6 months ago
2011
Springer
ABSTRACT. Upon the discovery of power laws [8, 16, 30], a large body of work in complex network analysis has focused on developing generative models of graphs which mimick real-wor...
65
Voted
EJC
2006
14 years 11 months ago
2006
In this paper we study the sequence (ci)0id for a distance-regular graph. In particular we show that if d 2j and cj = c > 1 then c2j > c holds. Using this we give improveme...
JEA
2008
14 years 11 months ago
2008
JMIV
2006
14 years 11 months ago
2006
We address the problem of reconstructing a planar shape from a finite number of noisy measurements of its support function or its diameter function. New linear and non-linear algor...