Graphs G where G-N[v] is a regular graph for each vertex v.
Bo ZhangBaoyindureng WuPublished in: Comput. Appl. Math. (2024)
Keyphrases
- labeled graphs
- undirected graph
- directed graph
- edge weights
- attributed graphs
- graph representation
- hamiltonian cycle
- graph theory
- weighted graph
- vertex set
- graph structure
- adjacency matrix
- maximum cardinality
- graph matching
- average degree
- bipartite graph
- graph properties
- graph kernels
- graph theoretical
- graph partitioning
- minimum weight
- spanning tree
- graph data
- random graphs
- graph structures
- random walk
- graph databases
- graph theoretic
- graph model
- connected subgraphs
- graph construction
- graph classification
- dynamic graph
- graph clustering
- graph search
- graph mining
- directed acyclic graph
- subgraph isomorphism
- strongly connected
- frequent subgraphs
- connected dominating set
- graph transformation
- real world graphs
- graph representations
- series parallel
- minimum spanning tree
- planar graphs
- complex networks
- structural pattern recognition
- graph drawing
- regular expressions
- graph isomorphism
- social graphs
- connected components
- neighborhood graph
- directed acyclic
- structured data
- evolving graphs
- maximum common subgraph
- betweenness centrality
- approximation algorithms
- small world
- reachability queries
- graph embedding
- connected graphs
- inexact graph matching
- shortest path