Sciweavers

1395 search results - page 22 / 279
» (k, )-Distance-Hereditary Graphs
Sort
View
JCT
2011
83views more  JCT 2011»
14 years 4 months ago
Sandpile groups and spanning trees of directed line graphs
Abstract. We generalize a theorem of Knuth relating the oriented spanning trees of a directed graph G and its directed line graph LG. The sandpile group is an abelian group associa...
Lionel Levine
COCOON
2005
Springer
15 years 3 months ago
Conditionally Critical Indecomposable Graphs
Chandan K. Dubey, Shashank K. Mehta, Jitender S. D...
59
Voted
ICRA
1994
IEEE
97views Robotics» more  ICRA 1994»
15 years 1 months ago
Gait Generation for a Six-Legged Walking Machine Through Graph Search
Prabir K. Pal, Mahadev Venkatraman, K. Jayarajan
APPML
2011
14 years 4 months ago
Bounds on the k-domination number of a graph
The k-domination number of a graph is the cardinality of a smallest set of vertices such that every vertex not in the set is adjacent to at least k vertices of the set. We prove t...
Ermelinda DeLaViña, Wayne Goddard, Michael ...
DM
2008
94views more  DM 2008»
14 years 9 months ago
On low degree k-ordered graphs
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...
Karola Mészáros