;
;
;
"ActiveFedora::Aggregation::ListSource" .
a ,
;
"A characteristic polynomial for rooted graphs and rooted digraphs"@en;
;
"heidenwt@lafayette.edu";
"Gordon, Gary",
"McMahon, Elizabeth";
"en";
"Discrete Mathematics";
"We consider the one-variable characteristic polynomial p(G; lambda) in two settings. When G is a rooted digraph, we show that this polynomial essentially counts the number of sinks in G. When G is a rooted graph, we give combinatorial interpretations of several coefficients and the degree of p(G; lambda). Ln particular, /p(G; 0)/ is the number of acyclic orientations of G, while the degree of p(G; lambda) gives the size of the minimum tree cover (every edge of G is adjacent to some edge of T), and the leading coefficient gives the number of such covers. Finally, we consider the class of rooted fans in detail; here p(G; lambda) shows cyclotomic behavior.";
"2018-12-21T15:50:36Z";
"Gordon, G. and E. McMahon (2001) \"A characteristic polynomial for rooted graphs and rooted digraphs.\" Discrete Mathematics 232 (1-3): 19-33.";
"2019-10-20T00:12:06.330842559+00:00"^^;
"doi:10.1016/S0012-365X(00)00186-2",
"hdl:10385/2491",
"noid:rv042t434";
;
"2001";
"2020-01-31T16:53:45.211866964+00:00"^^;
"Elsevier Science B. V.";
"Article";
"rooted graph",
"rooted digraph",
"branching greedoid",
"characteristic polynomial";
"Mathematics";
"Natural Sciences";
"Lafayette College";
;
;
"http://rightsstatements.org/vocab/InC/1.0/";
;
;
;
"Publication" .
;
.