6 search results - page 1 / 2 » A Semiexact Degree Condition for Hamilton Cycles in Digraphs |
SIAMDM
2010
13 years 3 months ago
2010
DM
2006
13 years 5 months ago
2006
We conjecture new sufficient conditions for a digraph to have a Hamilton cycle. In view of applications, the conjecture is of interest in the areas where unitary matrices are of i...
DM
2008
13 years 5 months ago
2008
A weighted graph is one in which every edge e is assigned a nonnegative number w(e), called the weight of e. The weight of a cycle is defined as the sum of the weights of its edge...
DM
2002
13 years 4 months ago
2002
A generalized p-cycle is a digraph whose set of vertices can be partitioned into p parts that are cyclically ordered in such a way that the vertices in one part are adjacent only ...
JCT
2010
13 years 3 months ago
2010
A graph G on n vertices is Hamiltonian if it contains a cycle of length n and pancyclic if it contains cycles of length for all 3 ≤ ≤ n. Write α(G) for the independence numbe...