990 search results - page 17 / 198 » Sub-Graphs of Complete Graph |
IPL
2006
13 years 7 months ago
2006
A homogeneous set is a non-trivial module of a graph, i.e. a nonempty, non-unitary, proper vertex subset such that all its elements present the same outer neighborhood. Given two ...
CPC
2010
13 years 7 months ago
2010
We consider the minimum-weight path between any pair of nodes of the n-vertex complete graph in which the weights of the edges are i.i.d. exponentially distributed random variable...
DM
2008
13 years 7 months ago
2008
In this paper, we prove that cyclic hamiltonian cycle systems of the complete graph minus a 1-factor, Kn - I, exist if and only if n 2, 4( mod 8) and n = 2p with p
SIAMDM
2008
13 years 7 months ago
2008
Let Kn,n denote the complete bipartite graph with n vertices in each partite set and Kn,n +I denote Kn,n with a 1-factor added. It is proved in this paper that there exists an m-c...
IPL
2007
13 years 7 months ago
2007
This paper presents a construction of a minimum cycle basis for the direct product of two complete graphs on three or more vertices. With the exception of two special cases, such ...