Computer investigation of cubic graphs
Year: 1976
Type: report
Abstract: The following numbers N(n) of nonisomorphic connected cubic graphs with n vertices are found:Each graph is described by a drawing or/and by the list of its edges.Several additional data are given, such as the spectrum, the order of the automorphism group, and the number of circuits.The graphs are ordered lexicographically according to their eigenvalues in non-increasing order.Such an ordering of graphs seems to be a very natural one.The numbers of cubic graphs with several properties are given.
Source: TU/e Research Portal
Language: English
Topic: Graph Theory and Algorithms
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Keywords: cubic graphs, graph theory, graph structure
Open Access status: green
OpenAlex ID: W655025681
