Zero-symmetric graph
id:
zero-symmetric-graph-268-13729937
title:
Zero-symmetric graph
text:
In the mathematical field of graph theory, a zero-symmetric graph is a connected graph in which each vertex has exactly three incident edges and, for each two vertices, there is a unique symmetry taking one vertex to the other. Such a graph is a vertex-transitive graph but cannot be an edge-transitive graph: the number of symmetries equals the number of vertices, too few to take every edge to every other edge. The name for this class of graphs was coined by R. M. Foster in a 1966 letter to H. S.
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Zero-symmetric_graph
date created:
date modified:
2021-05-29T19:54:16Z
main entity:
{"identifier":"Q25303772","url":"https://www.wikidata.org/entity/Q25303772"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/3/36/18-vertex_zero-symmetric_graph.svg","width":163,"height":163}
fields total:
13
integrity:
14