A forbidden subgraph characterization of some graph classes using betweenness axioms.
Manoj ChangatAnandavally K. LakshmikuttyammaJoseph MathewsIztok PeterinPrasanth G. Narasimha-ShenoiGeetha SeethakuttyammaSimon SpacapanPublished in: Discret. Math. (2013)
Keyphrases
- complex networks
- graph theory
- betweenness centrality
- graph properties
- small world
- graph databases
- graph mining
- graph data
- axiomatic characterization
- labeled graphs
- graph classification
- maximum matching
- graph theoretic
- knowledge base
- subgraph mining
- subgraph isomorphism
- frequent subgraph mining
- directed graph
- connected components
- query graph
- subgraph matching
- stable set
- graph representation
- maximum weight
- edge weights
- spanning tree
- structured data
- graph structure
- frequent subgraphs
- pattern mining
- graph search
- random walk
- multi class
- graph clustering
- graph model
- dense subgraphs
- equivalence classes