Two classes of extreme graphs related to the maximum degree of an interchange graph.
Jianguo QianPublished in: Australas. J Comb. (1999)
Keyphrases
- random graphs
- graph representation
- graph theory
- graph matching
- directed graph
- graph databases
- graph structure
- graph theoretic
- weighted graph
- adjacency matrix
- graph classification
- graph model
- graph mining
- series parallel
- graph construction
- graph theoretical
- graph partitioning
- bipartite graph
- graph clustering
- graph properties
- graph data
- graph structures
- subgraph isomorphism
- graph drawing
- labeled graphs
- graph isomorphism
- directed acyclic
- structural pattern recognition
- spanning tree
- bounded degree
- graph kernels
- undirected graph
- maximum common subgraph
- graph transformation
- structured data
- graph search
- adjacency graph
- maximum clique
- graph representations
- polynomial time complexity
- proximity graph
- evolving graphs
- np complete
- planar graphs
- dynamic graph
- protein interaction networks
- equivalence classes
- inexact graph matching