The centroidal branches of a separable graph are edge reconstructible.
Robert MolinaPublished in: Discret. Math. (1998)
Keyphrases
- weighted graph
- undirected graph
- edge weights
- edge detection
- disjoint paths
- graph theory
- graph structure
- connected components
- graph representation
- graph theoretic
- vertex set
- graph matching
- directed graph
- bipartite graph
- edge information
- random walk
- edge detector
- spanning tree
- graph partitioning
- graph clustering
- strongly connected
- neural network