About: Vertex-transitive graph

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: Vertex-transitive graph Goto Sponge NotDistinct Permalink

An Entity of Type : owl:Thing, within Data Space : el.dbpedia.org associated with source document(s)

In the mathematical field of graph theory, a vertex-transitive graph is a graph G in which, given any two vertices v1 and v2 of G, there is some automorphism such that In other words, a graph is vertex-transitive if its automorphism group acts transitively on its vertices. A graph is vertex-transitive if and only if its graph complement is, since the group actions are identical.

Attributes	Values
rdfs:label	Vertex-transitive graph (en)
rdfs:comment	In the mathematical field of graph theory, a vertex-transitive graph is a graph G in which, given any two vertices v1 and v2 of G, there is some automorphism such that In other words, a graph is vertex-transitive if its automorphism group acts transitively on its vertices. A graph is vertex-transitive if and only if its graph complement is, since the group actions are identical. (en)
sameAs	Vertex-transitive graph Vertex-transitive graph
dbp:wikiPageUsesTemplate	dbt:MathWorld dbt:Graph_families_defined_by_their_automorphisms
Subject	Algebraic graph theory Regular graphs Graph families
prov:wasDerivedFrom	http://en.wikipedia.org/wiki/Vertex-transitive_graph?oldid=1022014367&ns=0
Wikipage page ID	581175 (xsd:integer)
page length (characters) of wiki page	6148 (xsd:nonNegativeInteger)
Wikipage revision ID	1022014367 (xsd:integer)
has abstract	In the mathematical field of graph theory, a vertex-transitive graph is a graph G in which, given any two vertices v1 and v2 of G, there is some automorphism such that In other words, a graph is vertex-transitive if its automorphism group acts transitively on its vertices. A graph is vertex-transitive if and only if its graph complement is, since the group actions are identical. Every symmetric graph without isolated vertices is vertex-transitive, and every vertex-transitive graph is regular. However, not all vertex-transitive graphs are symmetric (for example, the edges of the truncated tetrahedron), and not all regular graphs are vertex-transitive (for example, the Frucht graph and Tietze's graph). (en)
foaf:isPrimaryTopicOf	http://en.wikipedia.org/wiki/Vertex-transitive_graph
is Wikipage redirect of	Vertex transitive graph
is Link from a Wikipage to another Wikipage of	Folkman graph Franklin graph Möbius ladder 60 (number) Algebraic graph theory Antiprism graph Bidiakis cube Biregular graph Moore graph Brinkmann graph Cartesian product of graphs Cayley graph Generalized Petersen graph Gewirtz graph Dragan Marušič Odd graph Chvátal graph Circulant graph Circular coloring Clebsch graph Cube-connected cycles Cycle graph Cyclic group Line graph List of graph theory topics Complete graph Connectivity (graph theory) Continuous-time quantum walk Coordination sequence Cop-win graph Edge-transitive graph Hoffman graph Holt graph Errera graph Frucht's theorem Gosset graph Graph Graph automorphism Gray code Mirka Miller Half-transitive graph Hall–Janko graph Hamiltonian decomposition Hamiltonian path Hamming graph Johnson graph Lovász conjecture Lovász number Italo Jose Dejter Klavdija Kutnar Kneser graph McGee graph McKay–Miller–Širáň graph

Faceted Search & Find service v1.17_git151 as of Feb 20 2025

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Nov 11 2024, on Linux (x86_64-ubuntu_focal-linux-gnu), Single-Server Edition (72 GB total memory, 1 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2025 OpenLink Software