On complete systems of invariants for small graphs

International Journal of Computer Mathematics

Volumn 64, Issue 1-2, 1997, Pages 35-46

  Harary, Frank ^a   Nikolopoulos, Stavros D ^b  

^a New Mexico State University   (United States)

^b UNIVERSITY OF CYPRUS   (Cyprus)

Author keywords

Complete system of invariants; Cycle vector; Degree sequence; Edge vector; Graph isomorphism problem

Indexed keywords

ALGORITHMS; EQUIVALENCE CLASSES; INVARIANCE; MATRIX ALGEBRA; VECTORS;

COMPLETE INVARIANT SYSTEM; GRAPH ISOMORPHISM PROBLEM (GIP);

GRAPH THEORY;

EID: 0030650870     PISSN: 00207160     EISSN: None     Source Type: Journal    
DOI: 10.1080/00207169708804573     Document Type: Article

References (13)

1. Hakimi, S.L. (1962). On the realization of a set of integers as degrees of the vertices of a graph. J. SIAM Appl. Math., 10, 496-506.
2. Havel, V. (1955). A remark on the existence of finite graphs (Hungarian). Casopis Pest. Mat., 80, 477-480.
3. Harary, F. (1955). The number of linear, directed, rooted, and connected graphs. Trans. Amer. Math., Soc., 78, 445-463.
4. Harary, F. (1969). Graph Theory. Addison-Wesley, Reading.
5. Harary, F. and Palmer, E.M. (1973). Graphical Enumeration. Academic Press, New York.
6. Harary, F. and Nikolopoulos, S.D. (1995). Graph Isomorphism Problem for Small Graphs, DSP'95: International Conference on Digital Signal Processing, Limassol, pp.280-286.
7. Mathon, R. (1979). A note on the graph isomorphism counting problem. Inform. Process. Lett., 8, 131-132.
8. Nikolopoulos, S.D. (1995). Recognition properties for some classes of perfect graphs. 4th Twente Workshop on Graphs and Combinatorial Optimization, Enschede,pp. 198-203.
9. Nikolopoulos, S.D. (1995). Constant-time parallel recognition of split graphs. Inform. Process. Lett., 54, 1-8.
10. Senior, J.K. (1951). Partitions and their representative graphs. Amer. J. Math., 73, 663-689.
11. Trinajstic, N. (1969), Chemical Graph Theory. Addison - Wesley, Reading.
12. Read, R.C. and Corneil, D.G. (1977). The graph isomorphic disease. Journal of Graph Theory, 1, 339-363.
13. Köbler, J., Schöning, U. and Toran, J. (1993). The Graph Isomorphism Problem: Its Structural Complexity. Birkhäuser, Boston.