1857 search results - page 3 / 372 » Minimum Degree Orderings |
COMBINATORICS
2004
13 years 9 months ago
2004
We propose two alternative measures of the local irregularity of a graph in terms of its vertex degrees and relate these measures to the order and the global irregularity of the g...
JCT
2006
13 years 9 months ago
2006
Kuipers and Veldman conjectured that any 3-connected claw-free graph with order and minimum degree +6 10 is Hamiltonian for sufficiently large. In this paper, we prove that if...
DM
2008
13 years 9 months ago
2008
A simple graph G is k-ordered (respectively, k-ordered hamiltonian) if, for any sequence of k distinct vertices v1, . . . , vk of G, there exists a cycle (respectively, a hamilton...
DM
2008
13 years 9 months ago
2008
One of the basic results in graph theory is Dirac's theorem, that every graph of order n 3 and minimum degree n/2 is Hamiltonian. This may be restated as: if a graph of ord...
CCCG
2010
13 years 11 months ago
2010
In this paper, we enumerate the number of combinatorial changes of the the Euclidean minimum spanning tree (EMST) of a set of n moving points in 2dimensional space. We assume that...