An infinite series of regular edge- but not vertex-transitive graphs.
Felix LazebnikRaymond ViglionePublished in: J. Graph Theory (2002)
Keyphrases
- undirected graph
- vertex set
- weighted graph
- edge weights
- directed graph
- minimum weight
- approximation algorithms
- random graphs
- labeled graphs
- spanning tree
- attributed graphs
- directed acyclic graph
- graph structure
- minimum cost
- strongly connected
- connected components
- shortest path
- transitive closure
- graph theory
- complex networks
- average degree
- graph theoretic
- graph partitioning
- graph matching
- bipartite graph
- edge detection
- connected subgraphs
- minimum spanning trees
- maximum cardinality
- multiscale
- regular languages
- graph construction
- graph clustering
- np hard