Photo from archive.org
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… Click to show full 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 or a directed cycle of length 2a.
Keywords:
bipancyclicity balanced;
meyniel type;
type condition;
condition bipancyclicity;
bipartite digraphs;
balanced bipartite
Journal Title: Graphs and Combinatorics
Year Published: 2018
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!
Journal Title: Graphs and Combinatorics
Year Published: 2018
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!