Degree Lists and Connectedness are 3-Reconstructible for Graphs with At Least Seven Vertices.
Alexandr V. KostochkaMina NahviDouglas B. WestDara ZirlinPublished in: Graphs Comb. (2020)
Keyphrases
- random graphs
- weighted graph
- undirected graph
- adjacency matrix
- attributed graphs
- graph theoretic
- labeled graphs
- average degree
- connected components
- planar graphs
- connected subgraphs
- edge weights
- graph matching
- graph model
- graph mining
- directed graph
- maximal cliques
- query graph
- hamiltonian cycle
- small world
- graph clustering
- graph representation
- graph partitioning
- phase transition
- series parallel
- data sets
- degree distribution
- betweenness centrality
- random walk
- clustering algorithm