Symmetric graph
id:
symmetric-graph-242-12125762
title:
Symmetric graph
text:
In the mathematical field of graph theory, a graph G is symmetric if, given any two pairs of adjacent vertices u1—v1 and u2—v2 of G, there is an automorphism such that In other words, a graph is symmetric if its automorphism group acts transitively on ordered pairs of adjacent vertices. Such a graph is sometimes also called 1-arc-transitive or flag-transitive. By definition, a symmetric graph without isolated vertices must also be vertex-transitive. Since the definition above maps one edge to an
brand slug:
wiki
category slug:
encyclopedia
description:
Graph in which all ordered pairs of linked nodes are automorphic
original url:
https://en.wikipedia.org/wiki/Symmetric_graph
date created:
date modified:
2023-05-15T12:55:05Z
main entity:
{"identifier":"Q1205074","url":"https://www.wikidata.org/entity/Q1205074"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/9/91/Petersen1_tiny.svg","width":220,"height":220}
fields total:
13
integrity:
15