Characterizing Forbidden Pairs for the Edge-Connectivity of a Connected Graph to Be Its Minimum Degree.
Junfeng DuZiwen HuangLiming XiongPublished in: Axioms (2022)
Keyphrases
- connected components
- undirected graph
- weighted graph
- strongly connected
- spanning tree
- graph connectivity
- disjoint paths
- edge weights
- binary images
- directed graph
- pairwise
- random graphs
- graph representation
- random walk
- dominating set
- minimum cost
- vertex set
- connected dominating set
- graph theory
- edge detection
- level set
- graph model
- graph based algorithm
- graph mining
- graph structure
- edge disjoint
- neighborhood graph
- image segmentation
- edge information
- connected graphs
- shortest path
- structured data
- minimum cut
- data objects
- topological information
- bipartite graph
- minimum spanning tree