Articles liés à 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 - Couverture souple

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

Synopsis

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.

Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.

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.

Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.

Éditeur
Betascript Publishers
Date d'édition
2010
Langue
anglais
ISBN 10 
6130357214
ISBN 13 
9786130357214
Reliure
Tapa blanda
Nombre de pages
84
Éditeur
Surhone Lambert M., Timpledon Miriam T., Marseken Susan F.
Coordonnées du fabricant
non disponible
Personne responsable
non disponible