The square root of a digraph

DOI10.1016/S0021-9800(68)80079-1MaRDI QIDQ5554172zbMATH OpenFDO

Authors Dennis P. Geller

Publication date 1968

Published in Journal of Combinatorial Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0021-9800(68)80079-1

zbMATH Keywords

topology

Recommendations

• Nonnegative square roots of matrices
• Nonexistence of square roots of directed strongly regular graphs
• Computing square roots of graphs with low maximum degree
• Algorithms for Square Roots of Graphs
• Complexity of finding graph roots with girth conditions

Cited in

(7)

• Computing roots of graphs is hard
• Linear-time algorithms for tree root problems
• Characterization of n-path graphs and of graphs having n-th root
• Nonnegative square roots of matrices
• Square roots in finite full transformation semigroups
• Algorithms for outerplanar graph roots and graph roots of pathwidth at most 2
• Quasi-transitive mixed graphs and undirected squares of oriented graphs

This page was built for publication: The square root of a digraph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5554172)