Simplicial Graphs and Relationships to Different Graph Invariants.
Bert RanderathLutz VolkmannPublished in: Ars Comb. (1997)
Keyphrases
- graph structures
- graph structure
- graph theory
- directed graph
- graph representation
- graph matching
- weighted graph
- labeled graphs
- graph mining
- graph theoretic
- graph databases
- adjacency matrix
- random graphs
- graph construction
- graph properties
- graph clustering
- graph classification
- series parallel
- graph partitioning
- graph model
- graph theoretical
- graph data
- subgraph isomorphism
- undirected graph
- graph search
- bipartite graph
- graph isomorphism
- graph representations
- directed acyclic
- reachability queries
- evolving graphs
- dynamic graph
- adjacency graph
- real world graphs
- maximum common subgraph
- spanning tree
- structural pattern recognition
- edge weights
- graph embedding
- inexact graph matching
- graph kernels
- disk resident
- connected graphs
- community discovery
- graph transformation
- average degree
- maximum clique
- graph layout
- dense subgraphs
- attributed graphs
- graph patterns
- neighborhood graph
- graphical models
- graphical structure
- vertex set
- structural patterns
- maximal cliques
- small world
- association graph
- planar graphs
- finding the shortest path
- web graph
- community detection
- massive graphs
- maximum cardinality
- attributed relational graph
- connected dominating set
- quasi cliques
- proximity graph
- query graph
- topological information
- minimum spanning tree
- connected components
- random walk