Connectedness of the dart digraph and the squared-dart digraph
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
