| dbo:abstract
|
- En théorie des graphes, un graphe zéro-symétrique est un graphe cubique tel que pour tout couple de sommets, il existe un unique automorphisme envoyant le premier sur le second. On parle également de représentation graphique régulière cubique (GRR, pour Graphical Regular Representation) d'un groupe G lorsque le groupe des automorphismes du graphe zéro-symétrique est isomorphe à G. (fr)
- 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. M. Coxeter. In the context of group theory, zero-symmetric graphs are also called graphical regular representations of their symmetry groups. (en)
|
| dbo:thumbnail
| |
| dbo:wikiPageID
| |
| dbo:wikiPageLength
|
- 5152 (xsd:nonNegativeInteger)
|
| dbo:wikiPageRevisionID
| |
| dbo:wikiPageWikiLink
| |
| dbp:align
| |
| dbp:alt
|
- 18 (xsd:integer)
- Truncated cuboctahedron (en)
|
| dbp:caption
|
- The truncated cuboctahedron, a zero-symmetric polyhedron (en)
- The smallest zero-symmetric graph, with 18 vertices and 27 edges (en)
|
| dbp:direction
| |
| dbp:image
|
- 18 (xsd:integer)
- Great rhombicuboctahedron.png (en)
|
| dbp:width
| |
| dbp:wikiPageUsesTemplate
| |
| dcterms:subject
| |
| rdfs:comment
|
- En théorie des graphes, un graphe zéro-symétrique est un graphe cubique tel que pour tout couple de sommets, il existe un unique automorphisme envoyant le premier sur le second. On parle également de représentation graphique régulière cubique (GRR, pour Graphical Regular Representation) d'un groupe G lorsque le groupe des automorphismes du graphe zéro-symétrique est isomorphe à G. (fr)
- 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. (en)
|
| rdfs:label
|
- Graphe zéro-symétrique (fr)
- Zero-symmetric graph (en)
|
| owl:sameAs
| |
| prov:wasDerivedFrom
| |
| foaf:depiction
| |
| foaf:isPrimaryTopicOf
| |
| is dbo:wikiPageWikiLink
of | |
| is dbp:properties
of | |
| is foaf:primaryTopic
of | |
