Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
Filter
  • International Union of Crystallography (IUCr)  (1)
Collection
Publisher
Years
  • 1
    Electronic Resource
    Electronic Resource
    [S.l.] : International Union of Crystallography (IUCr)
    Acta crystallographica 34 (1978), S. 275-282 
    ISSN: 1600-5724
    Source: Crystallography Journals Online : IUCR Backfile Archive 1948-2001
    Topics: Chemistry and Pharmacology , Geosciences , Physics
    Notes: This paper is the first in a series concerned with a particular graph theoretical scheme for enumeration and derivation of structures of prescribed form. The problem spoken to by this work is that of finding a unique formal procedure for generating all distinct (i.e. non-isomorphic) graphs of a given number of vertices and prescribed valency. Here the scheme is outlined as applied to a search for regular trivalent graphs, some of which correspond to trivalent polyhedra. A systematic procedure for obtaining the number of equivalence classes of the adjacency matrices associated with trivalent graphs of n points is described. The procedure is of general applicability, though no proof of its correctness is offered. Instead, a number of examples are discussed, and its application is illustrated. The scheme is based on consideration of unique matrices associated with graphs which in turn are determined so that the corresponding binary code obtained by reading the rows of the matrix from left to right and from top to bottom represents the smallest possible binary code. Part of the scheme consists in finding all acceptable matrices, testing them for isomorphism, and selecting those which satisfy additional restrictions and ensure that the derived graph represents a structure of interest.
    Type of Medium: Electronic Resource
    Signatur Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...