-
Anglický jazyk
Symmetric Graph
Autor: Lambert M. Surhone
High Quality Content by WIKIPEDIA articles! In the mathematical field of graph theory, a graph is symmetric if its automorphism group acts transitively upon ordered pairs of linked vertices (that is, upon edges considered as having a direction). Such a graph... Viac o knihe
Na objednávku
132.91 €
bežná cena: 139.90 €
O knihe
High Quality Content by WIKIPEDIA articles! In the mathematical field of graph theory, a graph is symmetric if its automorphism group acts transitively upon ordered pairs of linked vertices (that is, upon edges considered as having a direction). Such a graph is sometimes also called 1-arc-transitive or flag-transitive. By definition (ignoring u1 and u2), a symmetric graph without isolated vertices must also be vertex transitive. Since the definition above maps one edge to another, a symmetric graph must also be edge transitive. However, an edge-transitive graph need not be symmetric, since a-b might map to c-d, but not to d-c. Semi-symmetric graphs, for example, are edge-transitive and regular, but not vertex-transitive.
- Vydavateľstvo: OmniScriptum
- Rok vydania: 2026
- Formát: Paperback
- Rozmer: 220 x 150 mm
- Jazyk: Anglický jazyk
- ISBN: 9786130357214
