3008 search results - page 290 / 602 » Independence in connected graphs |
164
click to vote
DM
2007
15 years 6 months ago
2007
We present an algorithm that determines the prime factors of connected graphs with respect to the Cartesian product in linear time and space. This improves a result of Aurenhammee...
168
Voted
GC
2007
Springer
15 years 6 months ago
2007
Springer
Let H be a multigraph and G a graph containing a subgraph isomorphic to a subdivision of H, with S ⊂ V (G) (the ground set) the image of V (H) under the isomorphism. We consider...
140
click to vote
JGT
2007
15 years 6 months ago
2007
Let Γ be an infinite, locally finite, connected graph with distance function δ. Given a ray P in Γ and a constant C ≥ 1, a vertex-sequence {xn}∞ n=0 ⊆ V P is said to be...
148
click to vote
GPEM
2008
15 years 6 months ago
2008
The coauthorship and coeditorship relations as recorded in the genetic programming bibliography provide a quantitative view of the GP community. Eigen analysis is used to find the ...
215
Voted
CORR
2010
Springer
15 years 1 months ago
2010
Springer
Unique-sink orientations (USOs) are an abstract class of orientations of the ncube graph. We consider some classes of USOs that are of interest in connection with the linear compl...