Examples of 'vertex-transitive' in a sentence
Meaning of "vertex-transitive"
Vertex-transitive is an adjective used in mathematics to describe a graph in which any vertex-to-vertex mapping is an automorphism
How to use "vertex-transitive" in a sentence
Basic
Advanced
vertex-transitive
Every vertex-transitive graph is a coset graph.
This vertex configuration defines the vertex-transitive icosidodecahedron.
Every vertex is vertex-transitive and every vertex is transitive with every other vertex.
A polyhedron which is isohedral has a dual polyhedron that is vertex-transitive isogonal.
Uniform polyhedra are vertex-transitive and every face is a regular polygon.
The McGee graph is the smallest cubic cage that is not a vertex-transitive graph.
It is not uniform, but it is vertex-transitive and has all regular polygon faces.
Vertex-transitive is a synonym borrowed from modern ideas such as symmetry groups and graph theory.
Lovász conjecture that vertex-transitive graphs are Hamiltonian.
The Gray graph is an example of a graph which is edge-transitive but not vertex-transitive.
We focus on vertex-transitive graphs, since we can compute the exact fractional solution for them.
This is because the dual Archimedean solids are vertex-transitive and not face-transitive.
Other vertex-transitive polyhedral graphs include the Archimedean graphs.
A well known conjecture stated that every infinite vertex-transitive graph is quasi-isometric to a Cayley graph.
As with many vertex-transitive graphs, the prism graphs may also be constructed as Cayley graphs.
See also
Unlike all other Moore graphs, Higman proved that the unknown Moore graph can not be vertex-transitive.
It is the smallest vertex-transitive graph that is not a Cayley graph.
The line graph of an edge-transitive graph is vertex-transitive.
It says, Every finite connected vertex-transitive graph contains a Hamiltonian path.
A semi-symmetric graph is a graph that is edge-transitive but not vertex-transitive.
Uniform if it is vertex-transitive and every face is a regular polygon, i . e.
A regular polyhedron is highly symmetrical, being all of edge-transitive, vertex-transitive and face-transitive.
A hypergraph is said to be vertex-transitive ( or vertex-symmetric ) if all of its vertices are symmetric.
It is the smallest undirected graph that is edge-transitive and regular, but not vertex-transitive.
A half-transitive graph is a graph that is vertex-transitive and edge-transitive but not symmetric.
A uniform dual is face-transitive and has regular vertices, but is not necessarily vertex-transitive.
Semi-regular if it is vertex-transitive but not edge-transitive, and every face is a regular polygon.
This honeycomb is cell-transitive, edge-transitive and vertex-transitive.
Every symmetric graph without isolated vertices is vertex-transitive, and every vertex-transitive graph is regular.
By definition ( ignoring u1 and u2 ), a symmetric graph without isolated vertices must also be vertex-transitive.
Every edge-transitive graph that is not vertex-transitive must be bipartite and either semi-symmetric or biregular.
As a further example, semi-symmetric graphs are edge-transitive and regular, but not vertex-transitive.
The Wagner graph is a vertex-transitive graph but is not edge-transitive.
Semi-symmetric graphs, for example, are edge-transitive and regular, but not vertex-transitive.
The Birkhoff polytope Bn is both vertex-transitive and facet-transitive i.e. the dual polytope is vertex-transitive.
A quasi-regular dual is face-transitive and edge-transitive ( and hence every vertex is regular ) but not vertex-transitive.
If it is face-transitive and vertex-transitive ( but not necessarily edge-transitive ).
Semi-regular, vertex-transitive but not edge-transitive, and every face is a regular polygon.
Noble, face-transitive and vertex-transitive but not necessarily edge-transitive.
Quasi-regular, vertex-transitive and edge-transitive ( and hence has regular faces ) but not face-transitive.
