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
A Meyniel-Type Condition for Bipancyclicity in Balanced Bipartite Digraphs
Sign Up to like & getrecommendations! Published in 2018 at "Graphs and Combinatorics"
DOI: 10.1007/s00373-018-1907-7
Abstract: We prove that a strongly connected balanced bipartite digraph D of order 2a, $$a\ge 3$$a≥3, satisfying $$d(u)+d(v)\ge 3a$$d(u)+d(v)≥3a for every pair of vertices u, v with a common in-neighbour or a common out-neighbour, is either bipancyclic… read more here.
Keywords: bipancyclicity balanced; meyniel type; type condition; condition bipancyclicity ... See more keywords
Some new sufficient conditions for 2p-Hamilton-biconnectedness of graphs
Sign Up to like & getrecommendations! Published in 2019 at "Filomat"
DOI: 10.2298/fil1903993c
Abstract: A balanced bipartite graph G is said to be 2p-Hamilton-biconnected if for any balanced subset W of size 2p of V(G), the subgraph induced by V(G)nW is Hamilton-biconnected. In this paper, we prove that ?Let… read more here.
Keywords: sufficient conditions; new sufficient; conditions hamilton; hamilton biconnectedness ... See more keywords