Sciweavers

11381 search results - page 304 / 2277
» Connectivity
Sort
View
FSS
2006
90views more  FSS 2006»
15 years 6 months ago
Fuzzy submonoids, fuzzy preorders and quasi-metrics
er is an extended abstract of my paper [12] published in Fuzzy Set and Systems. We start from a residuated lattice L and a monoid M, and we define a Galois connection from the lat...
Giangiacomo Gerla
GC
2007
Springer
15 years 6 months ago
Up-Embeddability of a Graph by Order and Girth
Let G be a connected graph of order n and girth g. If dG(u) + dG(v) ≥ n − 2g + 5 for any two non-adjacent vertices u and v, then G is up-embeddable. Further more, the lower bou...
Yichao Chen, Yanpei Liu
AAECC
2005
Springer
114views Algorithms» more  AAECC 2005»
15 years 6 months ago
The adjacency graph of a real algebraic surface
Abstract. The paper deals with the question of recognizing the mutual positions of the connected components of a non-singular real projective surface S in the real projective 3-spa...
Elisabetta Fortuna, Patrizia M. Gianni, Domenico L...
JUCS
2007
120views more  JUCS 2007»
15 years 6 months ago
Hamiltonicity of Topological Grid Graphs
: In this paper we study connectivity and hamiltonicity properties of the topological grid graphs, which are a natural type of planar graphs associated with finite subgraphs of th...
Christina Zamfirescu, Tudor Zamfirescu
COMBINATORICS
2000
112views more  COMBINATORICS 2000»
15 years 6 months ago
A Note on Random Minimum Length Spanning Trees
Consider a connected r-regular n-vertex graph G with random independent edge lengths, each uniformly distributed on [0, 1]. Let mst(G) be the expected length of a minimum spanning...
Alan M. Frieze, Miklós Ruszinkó, Lub...