A characterization of the non-trivial diameter two graphs of minimum size.
Michael A. HenningJustin SoutheyPublished in: Discret. Appl. Math. (2015)
Keyphrases
- maximal cliques
- graph theoretic
- spanning tree
- maximum distance
- memory requirements
- graph matching
- network size
- graph representation
- graph databases
- maximum clique
- graph kernels
- small size
- database
- weighted graph
- graph structure
- graph theory
- standard deviation
- social network analysis
- computational complexity
- pattern recognition