The supereulerian graphs in the graph family C(l, k).
Xiaomin LiDengxin LiHong-Jian LaiPublished in: Discret. Math. (2009)
Keyphrases
- graph representation
- graph structure
- graph theory
- graph databases
- graph matching
- graph theoretic
- directed graph
- weighted graph
- labeled graphs
- graph construction
- graph mining
- graph properties
- adjacency matrix
- graph structures
- graph model
- graph clustering
- graph data
- graph theoretical
- subgraph isomorphism
- random graphs
- undirected graph
- bipartite graph
- series parallel
- graph partitioning
- structural pattern recognition
- graph classification
- connected dominating set
- graph isomorphism
- graph transformation
- connected graphs
- random walk
- graph search
- query graph
- community discovery
- spanning tree
- maximum common subgraph
- inexact graph matching
- graph kernels
- dominating set
- reachability queries
- disk resident
- evolving graphs
- edge weights
- real world graphs
- dynamic graph
- web graph
- graph drawing
- graph representations
- social graphs
- maximum cardinality
- planar graphs
- structured data
- graph embedding
- equivalence class
- massive graphs
- complex networks
- directed acyclic
- graph patterns
- finding the shortest path
- special case
- connected components
- vertex set
- attributed graphs
- minimum spanning tree
- neighborhood graph
- polynomial time complexity
- fully connected
- maximum independent set
- maximal cliques
- bounded treewidth
- small world
- topological information
- dense subgraphs
- directed acyclic graph
- average degree
- maximum clique
- link analysis