Resolvability in Subdivision Graph of Circulant Graphs.
Syed Ahtsham Ul Haq BokharyKhola WahidUsman AliShreefa O. HilaliMohammed AlhagyanAmeni GargouriPublished in: Symmetry (2023)
Keyphrases
- graph theory
- graph representation
- graph theoretic
- weighted graph
- directed graph
- graph mining
- graph databases
- labeled graphs
- graph structure
- graph matching
- graph structures
- graph construction
- graph clustering
- graph model
- graph properties
- graph theoretical
- adjacency matrix
- random graphs
- graph classification
- graph data
- graph isomorphism
- graph partitioning
- series parallel
- undirected graph
- graph search
- graph representations
- subgraph isomorphism
- bipartite graph
- spanning tree
- graph kernels
- dense subgraphs
- reachability queries
- structural pattern recognition
- graph transformation
- maximum common subgraph
- spectral decomposition
- dynamic graph
- disk resident
- connected dominating set
- connected components
- graph drawing
- minimum spanning tree
- edge weights
- real world graphs
- evolving graphs
- maximal cliques
- graph patterns
- least squares
- proximity graph
- random walk
- maximum cardinality
- web graph
- neighborhood graph
- bounded treewidth
- attributed graphs
- average degree
- planar graphs
- shortest path
- maximum independent set
- graph layout
- fourier transform
- adjacency graph
- structured data
- finding the shortest path
- connected graphs
- inexact graph matching
- directed acyclic
- query graph
- directed acyclic graph
- maximum clique
- fully connected