Connectedness of the dart digraph and the squared-dart digraph
classification
🧮 math.CO
keywords
dartdigraphconnectedappliedconnectednessconstructionsdigraphsgraph
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.