Extremality and Sharp Bounds for the k-edge-connectivity of Graphs.
Yuefang SunXiaoyan ZhangZhao ZhangPublished in: CoRR (2019)
Keyphrases
- weighted graph
- undirected graph
- strongly connected
- upper bound
- connected components
- graph matching
- edge detection
- minimum spanning trees
- sharp edges
- edge weights
- graph theory
- graph connectivity
- adjacency graph
- upper and lower bounds
- high quality
- directed graph
- edge information
- disjoint paths
- topological information
- topological features
- vertex set
- average case
- graph theoretic
- graph kernels
- graph construction
- subgraph isomorphism
- spanning tree
- graph mining
- random graphs
- graph structure
- graph model
- bipartite graph
- densely connected
- graph partitioning