EdgeTransitiveGraphQ
Details
- A graph g is edge transitive if for any edges e1 and e2 of g, there is an automorphism of g that maps e1 to e2.
- EdgeTransitiveGraphQ is typically used to test whether all edges in a graph have identical neighborhoods.
Examples
open allclose allScope (7)
EdgeTransitiveGraphQ gives False for anything that is not an edge-transitive graph:
EdgeTransitiveGraphQ works with large graphs:
Applications (1)
Generate a list of edge-transitive graphs from GraphData:
Properties & Relations (5)
Connected edge-transitive graphs are either vertex transitive or bipartite:
Use VertexTransitiveGraphQ to test whether a connected graph is edge transitive:
THe edge-transitive graphs need not be vertex transitive:
The vertex connectivity of an edge-transitive graph equals its minimum degree:
The edge-transitive graph includes CompleteGraph:
Text
Wolfram Research (2021), EdgeTransitiveGraphQ, Wolfram Language function, https://reference.wolfram.com/language/ref/EdgeTransitiveGraphQ.html.
CMS
Wolfram Language. 2021. "EdgeTransitiveGraphQ." Wolfram Language & System Documentation Center. Wolfram Research. https://reference.wolfram.com/language/ref/EdgeTransitiveGraphQ.html.
APA
Wolfram Language. (2021). EdgeTransitiveGraphQ. Wolfram Language & System Documentation Center. Retrieved from https://reference.wolfram.com/language/ref/EdgeTransitiveGraphQ.html