Items related to 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
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.
"synopsis" may belong to another edition of this title.
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.
"About this title" may belong to another edition of this title.
Search results for Symmetric Graph: Mathematics, Graph Theory, Graph (mathemati...
Seller Image
Symmetric Graph
Published by
VDM Verlag Dr. Müller E.K. Feb 2010, 2010
ISBN 10: 6130357214
ISBN 13: 9786130357214
New
Taschenbuch
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. Englisch. Seller Inventory # 9786130357214
Seller Image
Symmetric Graph : Mathematics, Graph Theory, Graph (mathematics), Graph Automorphism, Group Action, Vertex-transitive Graph, Edge-transitive Graph, Semi-symmetric Graph, Distance-Transitive Graph
Print on DemandSeller: AHA-BUCH GmbH, Einbeck, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - 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. Seller Inventory # 9786130357214
Seller Image
Symmetric Graph | Mathematics, Graph Theory, Graph (mathematics), Graph Automorphism, Group Action, Vertex-transitive Graph, Edge-transitive Graph, Semi-symmetric Graph, Distance-Transitive Graph
Print on DemandSeller: preigu, Osnabrück, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. Symmetric Graph | Mathematics, Graph Theory, Graph (mathematics), Graph Automorphism, Group Action, Vertex-transitive Graph, Edge-transitive Graph, Semi-symmetric Graph, Distance-Transitive Graph | Lambert M. Surhone (u. a.) | Taschenbuch | Englisch | 2026 | OmniScriptum | EAN 9786130357214 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu Print on Demand. Seller Inventory # 101336695