Degrees in a digraph whose nodes are graphs

Discrete Mathematics

Volumn 150, Issue 1-3, 1996, Pages 17-29

  Balińska, Krystyna T ^a   Quintas, Louis V ^b  

^a POZNAN UNIVERSITY OF TECHNOLOGY   (Poland)

^b PACE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0010005056     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/0012-365X(95)00172-S     Document Type: Article

References (16)

1. K.T. Balińska, H. Galina and L.V. Quintas, A kinetic approach to the random f-graph process, Graph Theory Notes of New York XXIII, New York Academy of Sciences (1992) 35-40.
2. K.T. Balińska and L.V. Quintas, Random graph models for physical systems, in: Graph Theory and Topology in Chemisry, Studies in Physical and Theoretical Chemistry, Vol. 51 (Elsevier, Amsterdam, 1987) 349-361.
3. K.T. Balińska and L.V. Quintas, The sequential generation of random f-graphs. Line maximal 2- 3- and 4-graphs. Comput. Chem. 14 (1990) 323-328.
4. K.T. Balińska and L.V. Quintas, The algorithm IMAGE for the random 2-graph process, Computer Science Center Report No. 334, The Technical University of Poznań, 1990.
5. K.T. Balińska and L.V. Quintas, The sequential generation of random f-graphs. Distributions and predominant types of line maximal f-graphs for f > 4, in: Proc. of Combinatorics and Algorithms, Jerusalem, November 13-17, 1988, a journal version appears in Discrete Math. 114 (1993) 19-22.
6. K.T. Balińska and L.V. Quintas, The sequential generation of random edge maximal f-graphs as a function of f. J. Math. Chem. 8 (1991) 39-51.
7. K.T. Balińska and L.V. Quintas, Edge maximal graphs with large bounded degree, Advances in Graph Theory (Vishwa International Publications, Gulbarga, India, 1991) 11-18.
8. K.T. Balińska and L.V. Quintas, The random f-graph process, in: Proc. of Quo Vadis, Graph Theory?, Ann. Discrete Math. 55 (1992) 333-340.
9. K.T. Balińska and L.V. Quintas, Properties of the transition digraph of the random 2-graph process, Carribean J. Math. Comput. Sci. (in press).
10. K.T. Balińska and L.V. Quintas, The algorithm IMAGE f for the random f-graph process, Computer Science Center Report No. 362, The Technical University of Poznań, 1992.
11. K.T. Balińska and P. Szmanda, An algorithm concerning the distribution of orexic vertices in the random 2-graph process, Graph Theory Notes of New York XX, New York Academy of Sciences (1991) 28-33.
12. P. Hell and L.V. Quintas, An intermediate value theorem for graphs with given automorphism group, J. Graph Theory 3 (1979) 35-41.
13. J.W. Kennedy and L.V. Quintas, Probability models for random f-graphs, in: Proc. of Combinatorial Mathematics, New York, June 10-14, 1985; a journal version appears in Ann. N.Y. Acad. Sci. 5 (1989) 248-261.
14. L.V. Quintas, Extrema concerning asymmetric graphs, J. Combin. Theory 3 (1967) 57-82.
15. A. Ruciński and N.C. Wormald, Random graph processes with degree restrictions. Combin. Probab. Comput. 1 (1992) 169-180.
16. P. Szmanda, The algorithm DOV for the random 2-graph process, Computer Science Center Report No. 335, The Technical University of Poznań, 1990.