Connectedness of the dart digraph and the squared-dart digraph
Combinatorics
2016-08-30 v1
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.
Keywords
Cite
@article{arxiv.1608.08045,
title = {Connectedness of the dart digraph and the squared-dart digraph},
author = {Primož Potočnik and Steve Wilson},
journal= {arXiv preprint arXiv:1608.08045},
year = {2016}
}
Comments
4 pages, no pictures