30 search results - page 4 / 6 » dam 2000 |
DAM
2000
13 years 5 months ago
2000
Given an undirected graph with a nonnegative weight on each edge, the shortest total path length spanning tree problem is to
DAM
2000
13 years 5 months ago
2000
A graph G is chordal if it contains no chordless cycle of length at least four and is k-chordal if a longest chordless cycle in G has length at most k. In this note it is proved t...
DAM
2000
13 years 5 months ago
2000
An (n; k)-sequence has been studied. A permutation a1; a2; : : : ; akn of 0; 1; : : : ; kn - 1 is an (n; k)-sequence if as+d -as at+d -at (mod n) whenever as+d=n = as=n and at+d=...
DAM
2007
13 years 5 months ago
2007
This note extends results of Fern´andez, Leighton, and L´opez-Presa on the uniqueness of rth roots for disconnected graphs with respect to the Cartesian product to other product...
DAM
2000
13 years 5 months ago
2000
An irredundant set of vertices V V in a graph G = (V; E) has the property that for every vertex u V ; N[V - {u}] is a proper subset of N[V ]. We investigate the parameterized co...