On the Δ-interval and the Δ-convexity numbers of graphs and graph products.
Bijo S. AnandMitre Costa DouradoPrasanth G. Narasimha-ShenoiSabeer Sain RamlaPublished in: Discret. Appl. Math. (2022)
Keyphrases
- graph representation
- graph structure
- graph theory
- directed graph
- graph matching
- labeled graphs
- graph databases
- graph theoretic
- adjacency matrix
- graph model
- graph construction
- graph mining
- graph structures
- graph clustering
- weighted graph
- bipartite graph
- graph theoretical
- graph data
- graph classification
- graph properties
- subgraph isomorphism
- random graphs
- graph kernels
- graph search
- series parallel
- undirected graph
- graph transformation
- graph partitioning
- structural pattern recognition
- directed acyclic
- spanning tree
- evolving graphs
- adjacency graph
- dynamic graph
- web graph
- graph representations
- connected dominating set
- graph isomorphism
- maximum common subgraph
- random walk
- maximum clique
- social graphs
- average degree
- reachability queries
- maximum cardinality
- planar graphs
- neighborhood graph
- minimum spanning tree
- edge weights
- association graph
- connected graphs
- fully connected
- real numbers
- dominating set
- disk resident
- graph drawing
- inexact graph matching
- quasi cliques
- graph layout
- bounded treewidth
- dense subgraphs
- query graph
- attributed graphs
- maximal cliques
- frequent subgraphs
- spectral decomposition
- real world graphs
- strongly connected
- directed acyclic graph
- link analysis
- structured data