The construction of a smallest unstable asymmetric graph and a family of unstable asymmetric graphs with an arbitrarily high index of instability.
Josef LauriRussell MizziRaffaele ScapellatoPublished in: Discret. Appl. Math. (2019)
Keyphrases
- directed graph
- graph structure
- graph theory
- graph representation
- graph matching
- weighted graph
- graph theoretic
- graph partitioning
- graph construction
- graph structures
- spanning tree
- graph mining
- undirected graph
- subgraph isomorphism
- random graphs
- graph databases
- query graph
- graph properties
- labeled graphs
- graph classification
- graph search
- graph clustering
- minimum spanning tree
- graph model
- neighborhood graph
- adjacency matrix
- graph embedding
- small world
- graph theoretical
- structural pattern recognition
- graph data
- bipartite graph
- graph transformation
- social graphs
- connected graphs
- polynomial time complexity
- web graph
- attributed graphs
- connected components