Abstract
In this note we revisit the dart graph and the squared dart digraph constructions and prove that they yield strongly connected digraphs when applied to connected graphs of minimum valence at least 3.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.