67,419 research outputs found
A sufficient condition for a balanced bipartite digraph to be hamiltonian
We describe a new type of sufficient condition for a balanced bipartite
digraph to be hamiltonian. Let be a balanced bipartite digraph and be
distinct vertices in . dominates a vertex if
and ; in this case, we call the pair dominating. In
this paper, we prove that a strong balanced bipartite digraph on
vertices contains a hamiltonian cycle if, for every dominating pair of vertices
, either and or and
. The lower bound in the result is sharp.Comment: 12 pages, 3 figure
Existence of spanning and dominating trails and circuits
Let T be a trail of a graph G. T is a spanning trail (S-trail) if T contains all vertices of G. T is a dominating trail (D-trail) if every edge of G is incident with at least one vertex of T. A circuit is a nontrivial closed trail. Sufficient conditions involving lower bounds on the degree-sum of vertices or edges are derived for graphs to have an S-trail, S-circuit, D-trail, or D-circuit. Thereby a result of Brualdi and Shanny and one mentioned by Lesniak-Foster and Williamson are improved
- β¦