95 search results - page 1 / 19 » Hamiltonian-Laceability of Star Graphs |
ISPAN
1997
IEEE
13 years 9 months ago
1997
IEEE
AAIM
2011
Springer
12 years 8 months ago
2011
Springer
A star forest is a collection of vertex-disjoint trees of depth at most 1, and its size is the number of leaves in all its components. A spanning star forest of a given graph G is ...
ECEASST
2010
13 years 2 months ago
2010
Abstract. The precise specification of software models is a major concern in model-driven design of object-oriented software. In this paper, we investigate how program graphs, a la...
IAJIT
2011
12 years 8 months ago
2011
: Both the pancake graph and star graph are Cayley graphs and are especially attractive for parallel processing. They both have sublogarithmic diameter, and are fairly sparse compa...
DM
2002
13 years 4 months ago
2002
A star forest of a graph G is a spanning subgraph of G in which each component is a star. The minimum number of edges required to guarantee that an arbitrary graph, or a bipartite...