The irregularity of graphs under graph operations.
Hosam AbdoDarko DimitrovPublished in: Discuss. Math. Graph Theory (2014)
Keyphrases
- graph theory
- graph representation
- graph matching
- weighted graph
- directed graph
- graph structure
- graph construction
- graph databases
- adjacency matrix
- labeled graphs
- graph model
- graph theoretic
- graph theoretical
- graph mining
- graph classification
- graph clustering
- graph search
- graph properties
- graph partitioning
- graph structures
- series parallel
- random graphs
- graph data
- bipartite graph
- subgraph isomorphism
- graph isomorphism
- graph representations
- graph edit distance
- reachability queries
- graph transformation
- undirected graph
- random walk
- graph embedding
- graph kernels
- dense subgraphs
- planar graphs
- dynamic graph
- finding the shortest path
- structural pattern recognition
- maximum common subgraph
- attributed graphs
- maximum independent set
- minimum spanning tree
- web graph
- graph drawing
- disk resident
- connected dominating set
- structured data
- massive graphs
- spanning tree
- neighborhood graph
- query graph
- bounded treewidth
- graph layout
- pattern mining
- edge weights
- connected graphs
- directed acyclic
- maximal cliques
- proximity graph
- adjacency graph
- strongly connected
- maximum clique
- maximum cardinality
- social graphs
- inexact graph matching
- average degree
- topological information
- quasi cliques
- fully connected
- dominating set
- association graph
- real world graphs
- spectral decomposition
- evolving graphs
- polynomial time complexity
- graph patterns