GRAPH (Group of a) 2)
← Back
"The collection of all its automorphisms" (F. HARARY, 1967, p.25).
Different graphs can be topologically isomorphic, and thus reunited through a group.
F. HARARY writes: "It is a permutation group acting on the set of points (nodes). It is known (FRUCHT, 1949) that every finite group is abstractly isomorphic to the group of some graph" (Ibid).
This author also defines the line (edge) group of a graph: "The permutation group whose objects are the lines of G and whose permutations are induced by those of the group of automorphisms" (Ibid).
Categories
- 1) General information
- 2) Methodology or model
- 3) Epistemology, ontology and semantics
- 4) Human sciences
- 5) Discipline oriented
Publisher
Bertalanffy Center for the Study of Systems Science(2020).
To cite this page, please use the following information:
Bertalanffy Center for the Study of Systems Science (2020). Title of the entry. In Charles François (Ed.), International Encyclopedia of Systems and Cybernetics (2). Retrieved from www.systemspedia.org/[full/url]
We thank the following partners for making the open access of this volume possible: