Cycle-regular graphs of (0, lambda)-graph type.
Nawel KahoulAbdelhafid BerrachediPublished in: Discret. Math. (2010)
Keyphrases
- graph theory
- graph representation
- graph matching
- graph structure
- labeled graphs
- weighted graph
- directed graph
- graph theoretic
- graph structures
- graph databases
- adjacency matrix
- graph mining
- graph model
- graph construction
- graph search
- graph clustering
- subgraph isomorphism
- random graphs
- directed acyclic
- graph properties
- series parallel
- graph theoretical
- structural pattern recognition
- graph data
- graph representations
- graph classification
- dynamic graph
- undirected graph
- spanning tree
- bipartite graph
- graph partitioning
- graph isomorphism
- web graph
- evolving graphs
- social graphs
- reachability queries
- maximum common subgraph
- fully connected
- planar graphs
- random walk
- adjacency graph
- graph kernels
- maximum cardinality
- attributed relational graph
- maximum independent set
- social networks
- graph layout
- bounded degree
- connected graphs
- connected dominating set
- graph drawing
- graph transformation
- maximum clique
- community discovery
- minimum spanning tree
- pattern mining
- real world graphs
- dense subgraphs
- association graph
- topological information
- small world
- edge weights
- structured data
- shortest path