The vertex and edge graph reconstruction numbers of small graphs.
David RivshinStanislaw P. RadziszowskiPublished in: Australas. J Comb. (2009)
Keyphrases
- undirected graph
- edge weights
- weighted graph
- vertex set
- directed graph
- labeled graphs
- disjoint paths
- adjacency matrix
- spanning tree
- minimum weight
- graph structure
- connected components
- strongly connected
- random graphs
- bipartite graph
- directed acyclic graph
- graph theory
- graph clustering
- minimum cost
- maximum cardinality
- graph structures
- graph model
- graph representation
- approximation algorithms
- complex networks
- graph construction
- minimum spanning tree
- shortest path
- graph databases
- graph search
- random walk
- hamiltonian cycle
- graph classification
- attributed graphs
- graph partitioning
- graph theoretical
- graph theoretic
- connected subgraphs
- image reconstruction
- average degree
- betweenness centrality
- graph patterns
- structural pattern recognition
- dense subgraphs
- reachability queries
- social graphs
- graph transformation
- real world graphs
- graph data
- graph properties
- community detection
- graph mining
- subgraph isomorphism
- planar graphs