Verwandte Artikel zu Symmetric Graph: Mathematics, Graph Theory, Graph (mathemati...

Symmetric Graph: Mathematics, Graph Theory, Graph (mathematics), Graph Automorphism, Group Action, Vertex-transitive Graph, Edge-transitive Graph, Semi-symmetric Graph, Distance-Transitive Graph - Softcover

 
9786130357214: Symmetric Graph: Mathematics, Graph Theory, Graph (mathematics), Graph Automorphism, Group Action, Vertex-transitive Graph, Edge-transitive Graph, Semi-symmetric Graph, Distance-Transitive Graph
Softcover
ISBN 10: 6130357214 ISBN 13: 9786130357214
Verlag: Betascript Publishers, 2010

Inhaltsangabe

Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. 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.

Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.

Reseña del editor

Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. 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.

„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.

Verlag
Betascript Publishers
Erscheinungsdatum
2010
Sprache
Englisch
ISBN 10 
6130357214
ISBN 13 
9786130357214
Einband
Tapa blanda
Anzahl der Seiten
84
Herausgeber
Surhone Lambert M., Timpledon Miriam T., Marseken Susan F.
Kontakt zum Hersteller
Nicht verfügbar
Verantwortliche Person
Nicht verfügbar