14 search results - page 1 / 3 » Degree sum and connectivity conditions for dominating cycles |
DM
2008
13 years 7 months ago
2008
DM
2008
13 years 7 months ago
2008
DM
2008
13 years 7 months ago
2008
A weighted graph is one in which every edge e is assigned a nonnegative number w(e), called the weight of e. The weight of a cycle is defined as the sum of the weights of its edge...
TCS
2010
13 years 5 months ago
2010
— Rahman and Kaykobad introduced a shortest distance based condition for finding the existence of Hamiltonian paths in graphs as follows: Let G be a connected graph with n vertic...
GC
2007
Springer
13 years 7 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...