Connectedness of the dart digraph and the squared-dart digraph
Potočnik, Primož · Wilson, Steve
Original · EN
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.
English translation
This paper has no Arabic translation yet. Be the first: it takes a few seconds, and the result is stored for every future reader.