Spanning forests of a digraph and their applications

Automation and Remote Control

Volumn 62, Issue 3, 2001, Pages 443-466

  Agaev, R P ^a   Chebotarev, P Yu ^a  

^a TRAPEZNIKOV INSTITUTE OF CONTROL SCIENCES   (Russian Federation)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84904240042     PISSN: 00051179     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1002862312617     Document Type: Article

References (26)

1. Harary, F., Norman, R.Z., and Cartwright, D., Structural Models: An Introduction to the Theory of Directed Graphs, New York: Wiley, 1965.
2. Fiedler, M. and Sedláček, J., O W-basích Orientovaných Grafů, Časopis Pěst. Mat., 1958, vol. 83, pp. 214-225.
3. Kelmans, A.K. and Chelnokov, V.M., A Certain Polynomial of a Graph and Graphs with an Extremal Number of Trees, J. Comb. Theory, 1974, ser. B, vol. 16, pp. 197-214.
4. Liu, C.J. and Chow, Yu., Enumeration of Forests in a Graph, Proc. Am. Math. Soc., 1981, vol. 83, pp. 659-663.
5. Chaiken, S., A Combinatorial Proof of the All Minors Matrix Tree Theorem, SIAM J. Discr. Math., 1982, vol. 3, pp. 319-329.
6. Myrvold, W., Counting k-Component Forests of a Graph, Networks, 1992, vol. 22, pp. 647-652.
7. Bapat, R.B. and Constantine, G., An Enumerating Function for Spanning Forests with Color Restrictions, Linear Algebra Appl., 1992, vol. 173, pp. 231-237.
8. Takacs, L., Enumeration of Rooted Trees and Forests, Math. Sci., 1993, vol. 18, pp. 1-10.
9. Erdos, P.L., A New Bijection on Rooted Forests, Discrete Math., 1993, vol. 111, pp. 179-188.
10. Merris, R., Doubly Stochastic Graph Matrices, Univ. Beograd Publ. Elektrotehn. Fak. (Ser. Mat.), 1997, vol. 8, pp. 64-71.
11. Merris, R., Doubly Stochastic Graph Matrices II, Lin. Multilin. Algebra, 1998, vol. 45, pp. 275-285.
12. Chebotarev, P.Yu. and Agaev, R.P., The Matrix of Maximum Out Forests and Structural Properties of Systems Modeled by Digraphs, Modelling and Simulation of Systems, MOSIS-2000, 34th Spring Int. Conf., Ostrava, 2000, vol. 1, pp. 101-106.
13. Agaev, R.P. and Chebotarev, P.Yu., The Matrix of Maximum Out Forests and Its Applications, Avtom. Telemekh., 2000, no. 9, pp. 15-43.
14. Chebotarev, P.Yu. and Shamis, E.V., The Matrix-Forest Theorem and Measuring Relations in Small Social Groups, Avtom. Telemekh., 1997, no. 9, pp. 124-136.
15. Chebotarev, P.Yu. and Shamis, E.V., On Proximity Measures for Graph Vertices, Avtom. Telemekh., 1998, no. 10, pp. 113-133.
16. Harary, F., Graph Theory, Reading: Addison-Wesley, 1969.
17. Tutte, W.T., Graph Theory, Reading: Addison-Wesley, 1984.
18. Zykov, A.A., Teoriya konechnykh grafov (Theory of Finite Graphs), Novosibirsk: Nauka, 1969.
19. Faddeev, D.K. and Faddeeva, V.N., Computational Methods of Linear Algebra, San Francisco: Freeman, 1963.
20. Berman, A. and Plemmons, R., Nonnegative Matrices in the Mathematical Sciences, New York: Academic, 1979.
21. Gelfand, I.M., Lektsii po lineinoi algebre (Lectures on Linear Algebra), Moscow: Nauka, 1971.
22. Campbell, S.L. and Meyer, C.D., Generalized Inverses of Linear Transformations, London: Pitman, 1979.
23. Chebotarev, P.Yu. and Shamis, E.V., Preference Fusion when the Number of Alternatives Exceeds Two: Indirect Scoring Procedures, J. Franklin Inst., 1999, vol. 36, pp. 205-226.
24. Hall, K., An r-dimensional Quadratic Placement Problem, Manag. Sci., 1970, vol. 17, pp. 219-229.
25. Horn, R.A. and Johnson, C.R., Matrix Analysis, Cambridge: Cambridge Univ. Press, 1986.
26. Chebotarev, P.Yu. and Shamis, E.V., On a Duality Between Metrics and Σ-proximities, Avtom. Telemekh., 1998, no. 4, pp. 204-209.