On super restricted edge-connectivity of vertex-transitive graphs.
Yingzhi TianJixiang MengPublished in: Ars Comb. (2014)
Keyphrases
- undirected graph
- strongly connected
- connected components
- edge weights
- vertex set
- directed graph
- weighted graph
- spanning tree
- disjoint paths
- directed acyclic graph
- labeled graphs
- attributed graphs
- graph structure
- minimum weight
- transitive closure
- bipartite graph
- approximation algorithms
- complex networks
- edge information
- random graphs
- hamiltonian cycle
- graph representation
- graph model
- graph matching
- binary images
- graph connectivity
- average degree
- minimum spanning trees
- search algorithm
- topological information
- minimum spanning tree
- graph theory
- np hard