Exploració per tema "Diameter (Geometry)"
Ara es mostren els items 1-6 de 6
-
On the connectivity and superconnected graphs with small diameter
(2010-03-06)
Article
Accés restringit per política de l'editorialIn this paper, first we prove that any graph G is 2-connected if diam (G)≤ g-1 for even girth g, and for odd girth g and maximum degree $\Delta$ ≤ 2$\delta$-1 where $\delta$ is the minimum degree. Moreover, we prove that ... -
On the diameter of random planar graphs
(Iniciativa Digital Politècnica, 2011)
Text en actes de congrés
Accés obertWe show that the diameter D(Gn) of a random labelled connected planar graph with n vertices is asymptotically almost surely of order $n^{1/4}$, in the sense that there exists a constant c > 0 such that $P(D(G_n) \in{} ... -
On the restricted arc-connectivity of s-geodetic digraphs
(2010-10)
Article
Accés restringit per política de l'editorialFor a strongly connected digraph D the restricted arc-connectivity λ′(D) is defined as the minimum cardinality of an arc-cut over all arc-cuts S satisfying that D - S has a non-trivial strong component D₁ such that D-V ... -
On the superconnectivity in graphs with odd girth g and even girth h
(2009-09)
Article
Accés restringit per política de l'editorialA maximally connected graph G of minimum degree δ is said to be superconnected (for short super-κ) if all disconnecting sets of cardinality δ are the neighborhood of some vertex of degree δ. Sufficient conditions on the ... -
Some properties of higher order delaunay and gabriel graphs
(2010)
Text en actes de congrés
Accés obertWe consider two classes of higher order proximity graphs defined on a set of points in the plane, namely, the k-Delaunay graph and the k-Gabriel graph. We give bounds on the following combinatorial and geometric properties ... -
Superconnectivity of graphs with odd girth g and even girth h
(2009-09)
Text en actes de congrés
Accés restringit per política de l'editorialA maximally connected graph G of minimum degree δ is said to be superconnected (for short super-κ) if all disconnecting sets of cardinality δ are the neighborhood of some vertex of degree δ. Sufficient conditions on the ...
