Menu
Home
People
Places
Arts
History
Plants & Animals
Science
Life & Culture
Technology
Reference.org
Rooted graph
open-in-new
<h2 id="variations">Variations</h2> <p>In <a href="/facts/Topological_graph_theory/TAQ2DdVB">topological graph theory</a>, the notion of a rooted graph may be extended to consider multiple vertices or multiple edges as roots. The former are sometimes called vertex-rooted graphs in order to distinguish them from edge-rooted graphs in this context.<a class="footnote-ref" id="fnref:3" href="#fn:3"><sup>3</sup></a> Graphs with multiple nodes designated as roots are also of some interest in <a href="/facts/Combinatorics/k14xUoKT">combinatorics</a>, in the area of <a href="/facts/Random_graphs/gfQhq1Sz">random graphs</a>.<a class="footnote-ref" id="fnref:4" href="#fn:4"><sup>4</sup></a> These graphs are also called multiply rooted graphs.<a class="footnote-ref" id="fnref:5" href="#fn:5"><sup>5</sup></a> </p><p>The terms rooted <a href="/facts/Directed_graph/YBdfQ0um">directed graph</a> or rooted digraph also see variation in definitions. The obvious transplant is to consider a digraph rooted by identifying a particular node as root.<a class="footnote-ref" id="fnref:6" href="#fn:6"><sup>6</sup></a><a class="footnote-ref" id="fnref:7" href="#fn:7"><sup>7</sup></a> However, in <a href="/facts/Computer_science/lN3pEyPz">computer science</a>, these terms commonly refer to a narrower notion; namely, a rooted directed graph is a digraph with a distinguished node <i>r</i>, such that there is a directed path from <i>r</i> to any node other than <i>r</i>.<a class="footnote-ref" id="fnref:8" href="#fn:8"><sup>8</sup></a><a class="footnote-ref" id="fnref:9" href="#fn:9"><sup>9</sup></a><a class="footnote-ref" id="fnref:10" href="#fn:10"><sup>10</sup></a><a class="footnote-ref" id="fnref:11" href="#fn:11"><sup>11</sup></a> Authors who give the more general definition may refer to graphs meeting the narrower definition as <i>connected</i> rooted digraphs<a class="footnote-ref" id="fnref:12" href="#fn:12"><sup>12</sup></a> or <i>accessible</i> rooted graphs (see § Set theory). </p><p><i><a href="/facts/The_Art_of_Computer_Programming/MR1bMD9e">The Art of Computer Programming</a></i> defines rooted digraphs slightly more broadly, namely, a directed graph is called rooted if it has <i>at least one</i> node that can reach all the other nodes. Knuth notes that the notion thus defined is a sort of intermediate between the notions of <a href="/facts/Strongly_connected/P6rBqb7W">strongly connected</a> and <a href="/facts/Digraph_(mathematics)/YBdfQ0um">connected digraph</a>.<a class="footnote-ref" id="fnref:13" href="#fn:13"><sup>13</sup></a> </p> <h2 id="applications">Applications</h2> <h3>Flow graphs</h3> <p>In <a href="/facts/Computer_science/lN3pEyPz">computer science</a>, rooted graphs in which the root vertex can reach all other vertices are called flow graphs or flowgraphs.<a class="footnote-ref" id="fnref:14" href="#fn:14"><sup>14</sup></a> Sometimes an additional restriction is added specifying that a flow graph must have a single exit (<a href="/facts/Sink_(graph_theory)/YBdfQ0um">sink</a>) vertex.<a class="footnote-ref" id="fnref:15" href="#fn:15"><sup>15</sup></a> </p><p>Flow graphs may be viewed as <a href="/facts/Abstraction/p7l9eHGd">abstractions</a> of <a href="/facts/Flow_chart/BtNXBfUG">flow charts</a>, with the non-structural elements (node contents and types) removed.<a class="footnote-ref" id="fnref:16" href="#fn:16"><sup>16</sup></a><a class="footnote-ref" id="fnref:17" href="#fn:17"><sup>17</sup></a> Perhaps the best known sub-class of flow graphs are <a href="/facts/Control-flow_graph/BLsvNzcP">control-flow graphs</a>, used in <a href="/facts/Compiler/WNfCDFJe">compilers</a> and <a href="/facts/Program_analysis/oaJTAjhH">program analysis</a>. An arbitrary flow graph may be converted to a control-flow graph by performing an <a href="/facts/Edge_contraction/PRqKXEkj">edge contraction</a> on every edge that is the only outgoing edge from its source and the only incoming edge into its target.<a class="footnote-ref" id="fnref:18" href="#fn:18"><sup>18</sup></a> Another type of flow graph commonly used is the <a href="/facts/Call_graph/Uk0b0mdN">call graph</a>, in which nodes correspond to entire <a href="/facts/Subroutine/9vFJrg0A">subroutines</a>.<a class="footnote-ref" id="fnref:19" href="#fn:19"><sup>19</sup></a> </p><p>The general notion of flow graph has been called program graph,<a class="footnote-ref" id="fnref:20" href="#fn:20"><sup>20</sup></a> but the same term has also been used to denote only control-flow graphs.<a class="footnote-ref" id="fnref:21" href="#fn:21"><sup>21</sup></a> Flow graphs have also been called unlabeled flowgraphs<a class="footnote-ref" id="fnref:22" href="#fn:22"><sup>22</sup></a> and proper flowgraphs.<a class="footnote-ref" id="fnref:23" href="#fn:23"><sup>23</sup></a> These graphs are sometimes used in <a href="/facts/Software_testing/VoXzG9Tb">software testing</a>.<a class="footnote-ref" id="fnref:24" href="#fn:24"><sup>24</sup></a><a class="footnote-ref" id="fnref:25" href="#fn:25"><sup>25</sup></a> </p><p>When required to have a single exit, flow graphs have two properties not shared with directed graphs in general: flow graphs can be nested, which is the equivalent of a subroutine call (although there is no notion of passing parameters), and flow graphs can also be sequenced, which is the equivalent of sequential execution of two pieces of code.<a class="footnote-ref" id="fnref:26" href="#fn:26"><sup>26</sup></a> <i>Prime flow graphs</i> are defined as flow graphs that cannot be decomposed via nesting or sequencing using a chosen pattern of subgraphs, for example the primitives of <a href="/facts/Structured_programming/zA8b8dP1">structured programming</a>.<a class="footnote-ref" id="fnref:27" href="#fn:27"><sup>27</sup></a> Theoretical research has been done on determining, for example, the proportion of prime flow graphs given a chosen set of graphs.<a class="footnote-ref" id="fnref:28" href="#fn:28"><sup>28</sup></a> </p> <h3>Set theory</h3> <p><a href="/facts/Peter_Aczel/wY8yIB90">Peter Aczel</a> has used rooted directed graphs such that every node is reachable from the root (which he calls accessible pointed graphs) to formulate <a href="/facts/Aczel%2527s_anti-foundation_axiom/88l83EJl">Aczel's anti-foundation axiom</a> in <a href="/facts/Non-well-founded_set_theory/RkmGMC70">non-well-founded set theory</a>. In this context, each vertex of an accessible pointed graph models a (non-well-founded) set within Aczel's (non-well-founded) set theory, and an arc from a vertex <i>v</i> to a vertex <i>w</i> models that <i>v</i> is an element of <i>w</i>. <a href="/facts/Aczel%2527s_anti-foundation_axiom/88l83EJl">Aczel's anti-foundation axiom</a> states that every accessible pointed graph models a family of (non-well-founded) sets in this way.<a class="footnote-ref" id="fnref:29" href="#fn:29"><sup>29</sup></a> </p> <h3>Combinatorial game theory</h3> <p>Any <a href="/facts/Combinatorial_game_theory/fF4l0om2">combinatorial</a> <a href="/facts/Game/JNzato20">game</a>, can be associated with a rooted directed graph whose vertices are game positions, whose edges are moves, and whose root is the starting position of the game. This graph is important in the study of <a href="/facts/Game_complexity/r5Gqrqy7">game complexity</a>, where the <a href="/facts/Game_complexity/r5Gqrqy7">state-space complexity</a> is the number of vertices in the graph. </p> <h2 id="combinatorial-enumeration">Combinatorial enumeration</h2> <p>The number of rooted undirected graphs for 1, 2, ... nodes is 1, 2, 6, 20, 90, 544, ... (sequence A000666 in the <a href="/facts/On-Line_Encyclopedia_of_Integer_Sequences/yow6cVsU">OEIS</a>). </p> <h2 id="related-concepts">Related concepts</h2> <p>A special case of interest are <a href="/facts/Rooted_tree/TCWk4Joy">rooted trees</a>, the <a href="/facts/Tree_(graph_theory)/TCWk4Joy">trees</a> with a distinguished root vertex. If the directed paths from the root in the rooted digraph are additionally restricted to be unique, then the notion obtained is that of (rooted) <a href="/facts/Arborescence_(graph_theory)/qFKvoaLJ">arborescence</a>—the directed-graph equivalent of a rooted tree.<a class="footnote-ref" id="fnref:30" href="#fn:30"><sup>30</sup></a> A rooted graph contains an arborescence with the same root if and only if the whole graph can be reached from the root, and computer scientists have studied algorithmic problems of finding optimal arborescences.<a class="footnote-ref" id="fnref:31" href="#fn:31"><sup>31</sup></a> </p><p>Rooted graphs may be combined using the <a href="/facts/Rooted_product_of_graphs/JDMRjjD0">rooted product of graphs</a>.<a class="footnote-ref" id="fnref:32" href="#fn:32"><sup>32</sup></a> </p> <h2 id="see-also">See also</h2> <ul><li><a href="/facts/K-vertex-connected_graph/EST9uf8W">k-vertex-connected graph</a></li> <li><a href="/facts/Pointed_set/EELNN0pq">pointed set</a></li></ul> <h2 id="further-reading">Further reading</h2> <ul><li>McMahon, Elizabeth W. (1993), "On the greedoid polynomial for rooted graphs and rooted digraphs", <i>Journal of Graph Theory</i>, 17 (3): 433–442, <a href="/facts/Doi_(identifier)/muM9Etpq">doi</a>:<a href="https://doi.org/10.1002%2Fjgt.3190170316">10.1002/jgt.3190170316</a></li> <li>Gordon, Gary (2001), "A characteristic polynomial for rooted graphs and rooted digraphs", <i>Discrete Mathematics</i>, 232 (1–3): 19–33, <a href="/facts/Doi_(identifier)/muM9Etpq">doi</a>:<a href="https://doi.org/10.1016%2FS0012-365X%2800%2900186-2">10.1016/S0012-365X(00)00186-2</a></li></ul> <h2 id="external-links">External links</h2> <ul><li><a href="/facts/Eric_W._Weisstein/FbMuVDep">Weisstein, Eric W.</a>, <a href="https://mathworld.wolfram.com/RootedGraph.html">"Rooted Graph"</a>, <i><a href="/facts/MathWorld/yc1jodbq">MathWorld</a></i></li></ul> <h2 id="references">References</h2> <ol> <li id="fn:1"><p>Zwillinger, Daniel (2011), CRC Standard Mathematical Tables and Formulae, 32nd Edition, CRC Press, p. 150, ISBN 978-1-4398-3550-0 <a href="978-1-4398-3550-0" target="_blank">978-1-4398-3550-0</a> <a href="#fnref:1" class="footnote-back-ref">↩</a></p></li> <li id="fn:2"><p>Harary, Frank (1955), "The number of linear, directed, rooted, and connected graphs", Transactions of the American Mathematical Society, 78 (2): 445–463, doi:10.1090/S0002-9947-1955-0068198-2, MR 0068198. See p. 454. <a href="/wiki/Frank_Harary" target="_blank">/wiki/Frank_Harary</a> <a href="#fnref:2" class="footnote-back-ref">↩</a></p></li> <li id="fn:3"><p>Gross, Jonathan L.; Yellen, Jay; Zhang, Ping (2013), Handbook of Graph Theory (2nd ed.), CRC Press, pp. 764–765, ISBN 978-1-4398-8018-0 <a href="978-1-4398-8018-0" target="_blank">978-1-4398-8018-0</a> <a href="#fnref:3" class="footnote-back-ref">↩</a></p></li> <li id="fn:4"><p>Spencer, Joel (2001), The Strange Logic of Random Graphs, Springer Science & Business Media, chapter 4, ISBN 978-3-540-41654-8 <a href="978-3-540-41654-8" target="_blank">978-3-540-41654-8</a> <a href="#fnref:4" class="footnote-back-ref">↩</a></p></li> <li id="fn:5"><p>Harary (1955, p. 455). - Harary, Frank (1955), "The number of linear, directed, rooted, and connected graphs", Transactions of the American Mathematical Society, 78 (2): 445–463, doi:10.1090/S0002-9947-1955-0068198-2, MR 0068198 <a href="https://doi.org/10.1090%2FS0002-9947-1955-0068198-2" target="_blank">https://doi.org/10.1090%2FS0002-9947-1955-0068198-2</a> <a href="#fnref:5" class="footnote-back-ref">↩</a></p></li> <li id="fn:6"><p>Björner, Anders; Ziegler, Günter M. (1992), "8. Introduction to greedoids" (PDF), in White, Neil (ed.), Matroid Applications, Encyclopedia of Mathematics and its Applications, vol. 40, Cambridge: Cambridge University Press, pp. 284–357, doi:10.1017/CBO9780511662041.009, ISBN 0-521-38165-7, MR 1165537, Zbl 0772.05026, In this context a rooted digraph Δ = (V,E,r) is called connected (or 1-connected) if there is a directed path from the root to every vertex. See in particular p. 307. <a href="0-521-38165-7" target="_blank">0-521-38165-7</a> <a href="#fnref:6" class="footnote-back-ref">↩</a></p></li> <li id="fn:7"><p>Gordon, Gary; McMahon, Elizabeth (February 1989), "A greedoid polynomial which distinguishes rooted arborescences" (PDF), Proceedings of the American Mathematical Society, 107 (2): 287, CiteSeerX 10.1.1.308.2526, doi:10.1090/s0002-9939-1989-0967486-0, A rooted subdigraph F is a rooted arborescence if the root vertex ∗ is in F and, for every vertex v in F, there is a unique directed path in F from ∗ to v. Thus, rooted arborescences in digraphs correspond to rooted trees in undirected graphs. <a href="https://webbox.lafayette.edu/~gordong/pubs/greedoid.pdf" target="_blank">https://webbox.lafayette.edu/~gordong/pubs/greedoid.pdf</a> <a href="#fnref:7" class="footnote-back-ref">↩</a></p></li> <li id="fn:8"><p>Ramachandran, Vijaya (1988), "Fast Parallel Algorithms for Reducible Flow Graphs", Concurrent Computations: 117–138, doi:10.1007/978-1-4684-5511-3_8, ISBN 978-1-4684-5513-7, A rooted directed graph or a flow graph G = (V, A, r) is a directed graph with a distinguished vertex r such that there is a directed path in G from r to every vertex v in V − r.. See in particular p. 122. <a href="978-1-4684-5513-7" target="_blank">978-1-4684-5513-7</a> <a href="#fnref:8" class="footnote-back-ref">↩</a></p></li> <li id="fn:9"><p>Okamoto, Yoshio; Nakamura, Masataka (2003), "The forbidden minor characterization of line-search antimatroids of rooted digraphs" (PDF), Discrete Applied Mathematics, 131 (2): 523–533, doi:10.1016/S0166-218X(02)00471-7, A rooted digraph is a triple G=(V,E,r) where (V ∪ {r}, E) is a digraph and r is a specified vertex called the root such that there exists a path from r to every vertex of V.. See in particular p. 524. <a href="http://dopal.cs.uec.ac.jp/okamotoy/PDF/2003/rminorWEB.pdf" target="_blank">http://dopal.cs.uec.ac.jp/okamotoy/PDF/2003/rminorWEB.pdf</a> <a href="#fnref:9" class="footnote-back-ref">↩</a></p></li> <li id="fn:10"><p>Jain, Abhinandan (2010), Robot and Multibody Dynamics: Analysis and Algorithms, Springer Science & Business Media, p. 136, ISBN 978-1-4419-7267-5, A rooted digraph is a connected digraph with a single root node that is the ancestor of every other node in the digraph. <a href="978-1-4419-7267-5" target="_blank">978-1-4419-7267-5</a> <a href="#fnref:10" class="footnote-back-ref">↩</a></p></li> <li id="fn:11"><p>Chen, Xujin; Zang, Wenan (2006), "An efficient algorithm for finding maximum cycle packings in reducible flow graphs", Algorithmica, 44 (3): 195–211, doi:10.1007/s00453-005-1174-x, hdl:10722/48600, MR 2199991, S2CID 5235131 <a href="/wiki/Doi_(identifier)" target="_blank">/wiki/Doi_(identifier)</a> <a href="#fnref:11" class="footnote-back-ref">↩</a></p></li> <li id="fn:12"><p>Björner, Anders; Ziegler, Günter M. (1992), "8. Introduction to greedoids" (PDF), in White, Neil (ed.), Matroid Applications, Encyclopedia of Mathematics and its Applications, vol. 40, Cambridge: Cambridge University Press, pp. 284–357, doi:10.1017/CBO9780511662041.009, ISBN 0-521-38165-7, MR 1165537, Zbl 0772.05026, In this context a rooted digraph Δ = (V,E,r) is called connected (or 1-connected) if there is a directed path from the root to every vertex. See in particular p. 307. <a href="0-521-38165-7" target="_blank">0-521-38165-7</a> <a href="#fnref:12" class="footnote-back-ref">↩</a></p></li> <li id="fn:13"><p>Knuth, Donald (1997), "2.3.4.2. Oriented trees", The Art of Computer Programming, vol. 1 (3rd ed.), Pearson Education, p. 372, ISBN 0-201-89683-4, It is said to be rooted if there is at least one root, that is, at least one vertex R such that there is an oriented path from V to R for all V ≠ R. <a href="0-201-89683-4" target="_blank">0-201-89683-4</a> <a href="#fnref:13" class="footnote-back-ref">↩</a></p></li> <li id="fn:14"><p>Gross, Yellen & Zhang (2013, p. 1372). - Gross, Jonathan L.; Yellen, Jay; Zhang, Ping (2013), Handbook of Graph Theory (2nd ed.), CRC Press, pp. 764–765, ISBN 978-1-4398-8018-0 <a href="#fnref:14" class="footnote-back-ref">↩</a></p></li> <li id="fn:15"><p>Fenton, Norman Elliott; Hill, Gillian A. (1993), Systems Construction and Analysis: A Mathematical and Logical Framework, McGraw-Hill, p. 319, ISBN 978-0-07-707431-9. <a href="978-0-07-707431-9" target="_blank">978-0-07-707431-9</a> <a href="#fnref:15" class="footnote-back-ref">↩</a></p></li> <li id="fn:16"><p>Zuse, Horst (1998), A Framework of Software Measurement, Walter de Gruyter, pp. 32–33, ISBN 978-3-11-080730-1 <a href="978-3-11-080730-1" target="_blank">978-3-11-080730-1</a> <a href="#fnref:16" class="footnote-back-ref">↩</a></p></li> <li id="fn:17"><p>Samaroo, Angelina; Thompson, Geoff; Williams, Peter (2010), Software Testing: An ISTQB-ISEB Foundation Guide, BCS, The Chartered Institute, p. 108, ISBN 978-1-906124-76-2 <a href="978-1-906124-76-2" target="_blank">978-1-906124-76-2</a> <a href="#fnref:17" class="footnote-back-ref">↩</a></p></li> <li id="fn:18"><p>Tarr, Peri L.; Wolf, Alexander L. (2011), Engineering of Software: The Continuing Contributions of Leon J. Osterweil, Springer Science & Business Media, p. 58, ISBN 978-3-642-19823-6 <a href="978-3-642-19823-6" target="_blank">978-3-642-19823-6</a> <a href="#fnref:18" class="footnote-back-ref">↩</a></p></li> <li id="fn:19"><p>Jalote, Pankaj (1997), An Integrated Approach to Software Engineering, Springer Science & Business Media, p. 372, ISBN 978-0-387-94899-7 <a href="978-0-387-94899-7" target="_blank">978-0-387-94899-7</a> <a href="#fnref:19" class="footnote-back-ref">↩</a></p></li> <li id="fn:20"><p>Thulasiraman, K.; Swamy, M. N. S. (1992), Graphs: Theory and Algorithms, John Wiley & Sons, p. 361, ISBN 978-0-471-51356-8 <a href="978-0-471-51356-8" target="_blank">978-0-471-51356-8</a> <a href="#fnref:20" class="footnote-back-ref">↩</a></p></li> <li id="fn:21"><p>Cechich, Alejandra; Piattini, Mario; Vallecillo, Antonio (2003), Component-Based Software Quality: Methods and Techniques, Springer Science & Business Media, p. 105, ISBN 978-3-540-40503-0 <a href="978-3-540-40503-0" target="_blank">978-3-540-40503-0</a> <a href="#fnref:21" class="footnote-back-ref">↩</a></p></li> <li id="fn:22"><p>Beineke, Lowell W.; Wilson, Robin J. (1997), Graph Connections: Relationships Between Graph Theory and Other Areas of Mathematics, Clarendon Press, p. 237, ISBN 978-0-19-851497-8 <a href="978-0-19-851497-8" target="_blank">978-0-19-851497-8</a> <a href="#fnref:22" class="footnote-back-ref">↩</a></p></li> <li id="fn:23"><p>Zuse, Horst (1998), A Framework of Software Measurement, Walter de Gruyter, pp. 32–33, ISBN 978-3-11-080730-1 <a href="978-3-11-080730-1" target="_blank">978-3-11-080730-1</a> <a href="#fnref:23" class="footnote-back-ref">↩</a></p></li> <li id="fn:24"><p>Zuse, Horst (1998), A Framework of Software Measurement, Walter de Gruyter, pp. 32–33, ISBN 978-3-11-080730-1 <a href="978-3-11-080730-1" target="_blank">978-3-11-080730-1</a> <a href="#fnref:24" class="footnote-back-ref">↩</a></p></li> <li id="fn:25"><p>Jalote, Pankaj (1997), An Integrated Approach to Software Engineering, Springer Science & Business Media, p. 372, ISBN 978-0-387-94899-7 <a href="978-0-387-94899-7" target="_blank">978-0-387-94899-7</a> <a href="#fnref:25" class="footnote-back-ref">↩</a></p></li> <li id="fn:26"><p>Fenton & Hill (1993, p. 323). - Fenton, Norman Elliott; Hill, Gillian A. (1993), Systems Construction and Analysis: A Mathematical and Logical Framework, McGraw-Hill, p. 319, ISBN 978-0-07-707431-9 <a href="#fnref:26" class="footnote-back-ref">↩</a></p></li> <li id="fn:27"><p>Fenton & Hill (1993, p. 339). - Fenton, Norman Elliott; Hill, Gillian A. (1993), Systems Construction and Analysis: A Mathematical and Logical Framework, McGraw-Hill, p. 319, ISBN 978-0-07-707431-9 <a href="#fnref:27" class="footnote-back-ref">↩</a></p></li> <li id="fn:28"><p>Cooper, C. (2008), "Asymptotic Enumeration of Predicate-Junction Flowgraphs", Combinatorics, Probability and Computing, 5 (3): 215–226, doi:10.1017/S0963548300001991, S2CID 10313545 <a href="/wiki/Combinatorics,_Probability_and_Computing" target="_blank">/wiki/Combinatorics,_Probability_and_Computing</a> <a href="#fnref:28" class="footnote-back-ref">↩</a></p></li> <li id="fn:29"><p>Aczel, Peter (1988), Non-well-founded sets (PDF), CSLI Lecture Notes, vol. 14, Stanford, CA: Stanford University, Center for the Study of Language and Information, ISBN 0-937073-22-9, LCCN 87-17857, MR 0940014, archived from the original (PDF) on 2015-03-26 <a href="0-937073-22-9" target="_blank">0-937073-22-9</a> <a href="#fnref:29" class="footnote-back-ref">↩</a></p></li> <li id="fn:30"><p>Gordon, Gary; McMahon, Elizabeth (February 1989), "A greedoid polynomial which distinguishes rooted arborescences" (PDF), Proceedings of the American Mathematical Society, 107 (2): 287, CiteSeerX 10.1.1.308.2526, doi:10.1090/s0002-9939-1989-0967486-0, A rooted subdigraph F is a rooted arborescence if the root vertex ∗ is in F and, for every vertex v in F, there is a unique directed path in F from ∗ to v. Thus, rooted arborescences in digraphs correspond to rooted trees in undirected graphs. <a href="https://webbox.lafayette.edu/~gordong/pubs/greedoid.pdf" target="_blank">https://webbox.lafayette.edu/~gordong/pubs/greedoid.pdf</a> <a href="#fnref:30" class="footnote-back-ref">↩</a></p></li> <li id="fn:31"><p>Drescher, Matthew; Vetta, Adrian (2010), "An Approximation Algorithm for the Maximum Leaf Spanning Arborescence Problem", ACM Trans. Algorithms, 6 (3): 46:1–46:18, doi:10.1145/1798596.1798599, S2CID 13987985. <a href="https://escholarship.mcgill.ca/concern/theses/3n204190p" target="_blank">https://escholarship.mcgill.ca/concern/theses/3n204190p</a> <a href="#fnref:31" class="footnote-back-ref">↩</a></p></li> <li id="fn:32"><p>Godsil, C. D.; McKay, B. D. (1978), "A new graph product and its spectrum" (PDF), Bull. Austral. Math. Soc., 18 (1): 21–28, doi:10.1017/S0004972700007760, MR 0494910 <a href="/wiki/Chris_Godsil" target="_blank">/wiki/Chris_Godsil</a> <a href="#fnref:32" class="footnote-back-ref">↩</a></p></li> </ol>