A Degree Sum Condition for Hamiltonicity in Balanced Bipartite Digraphs
Sign Up to like & getrecommendations! Published in 2017 at "Graphs and Combinatorics"
DOI: 10.1007/s00373-016-1751-6
Abstract: We prove that a strongly connected balanced bipartite digraph D of order 2a is hamiltonian, provided $$a\ge 3$$a≥3 and $$d(x)+d(y)\ge 3a$$d(x)+d(y)≥3a for every pair of vertices x, y with a common in-neighbour or a common out-neighbour… read more here.
Keywords: condition hamiltonicity; sum condition; hamiltonicity balanced; bipartite digraphs ... See more keywords
Degree sum condition for fractional ID-$k$-factor-critical graphs
Sign Up to like & getrecommendations! Published in 2017 at "Miskolc Mathematical Notes"
DOI: 10.18514/mmn.2017.1264
Abstract: A graph G is called a fractional ID-k-factor-critical graph if after deleting any independent set of G the resulting graph admits a fractional k-factor. In this paper, we prove that for k 2, G is… read more here.
Keywords: factor; condition fractional; sum condition; fractional factor ... See more keywords