Sign Up to like & get
recommendations!
0
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