Forests and score vectors |
| |
| Authors: | Daniel J Kleitman Kenneth J Winston |
| |
| Institution: | (1) Department of Mathematics, Massachusetts Institute of Technology, 02139 Cambridge, Mass., USA |
| |
| Abstract: | Thescore vector of a labeled digraph is the vector of out-degrees of its vertices. LetG be a finite labeled undirected graph without loops, and let σ(G) be the set of distinct score vectors arising from all possible orientations ofG. Let ϕ(G) be the set of subgraphs ofG which are forests of labeled trees. We display a bijection between σ(G) and ϕ(G).
Supported in part by ONR Contract N00014-76-C-0366. |
| |
| Keywords: | 05 C 20 05 C 05 05 C 30 |
| 本文献已被 SpringerLink 等数据库收录！ |
|
