Showing papers on "Strongly regular graph published in 1976"
01 Jan 1976
TL;DR: The problem of graph identification has been studied in the theory of permutation groups for a long time, see as mentioned in this paper for a discussion of the main points of the problem and an algorithm for graph identification.
Abstract: Some remarks about the problem of graph identification.- Motivation.- A construction of a stationary graph.- Properties of cells.- Properties of cellular algebras of rank greater than one.- Cellular algebras arising in the theory of permutation groups.- Some classes of cellular algebras.- Imprimitive cells and construction of factor-cells.- Construction of the quotient in the case of cellular algebras of rank greater than one.- On the structure of correct stationary graphs and cells having more than one normal subcell.- Properties of primitive cells.- Algebraic properties of cellular algebras.- Some modifications of stabilization.- Kernels and stability with respect to kernels.- Deep stabilization.- Examples of results using the stability of depth 1.- Some definitions and explanations about exhaustive search.- An algorithm of graph canonization.- A practical algorithm of graph canonization.- An algorithm of construction of strongly regular graphs.- Tables of strongly regular graphs with n vertices, 10?n?28.- Some properties of 25- and 26- families.
218 citations
TL;DR: The middle graph M(G) of G is hamiltonian if and only if G contains a closed spanning trail and if G is connected and without points of degree =< 1.
53 citations
TL;DR: It is shown that the free product of at least two and at least countably many groups, each of which is at most countably generated, admits a graphical regular representation.
18 citations
TL;DR: In this paper, necessary conditions for realization of a sequence of integers as the degrees of a self-complementary graph are shown to be sufficient and an algorithm for constructing such a sequence as degrees of such a graph is illustrated.
16 citations