An infinite family of cubic edge- but not vertex-transitive graphs.
Aleksander MalnicDragan MarusicPrimoz PotocnikChangqun WangPublished in: Discret. Math. (2004)
Keyphrases
- undirected graph
- edge weights
- weighted graph
- vertex set
- directed graph
- minimum weight
- approximation algorithms
- special case
- directed acyclic graph
- attributed graphs
- spanning tree
- hamiltonian cycle
- labeled graphs
- complex networks
- b spline
- minimum cost
- edge information
- minimum spanning trees
- graph structure
- strongly connected
- connected components
- connected subgraphs
- average degree
- random graphs
- transitive closure
- bipartite graph
- edge detector
- minimum spanning tree
- graph partitioning
- series parallel
- complex structures
- edge detection
- subgraph isomorphism
- graph model
- expressive power
- scale space
- search algorithm
- neural network