Stability of graph pairs involving vertex-transitive graphs.
Yan-Li QinBinzhou XiaSanming ZhouPublished in: Discret. Math. (2024)
Keyphrases
- labeled graphs
- directed graph
- undirected graph
- edge weights
- attributed graphs
- weighted graph
- graph structure
- graph theory
- maximum cardinality
- hamiltonian cycle
- vertex set
- graph representation
- graph matching
- graph theoretic
- average degree
- minimum weight
- adjacency matrix
- connected subgraphs
- bipartite graph
- graph structures
- graph construction
- graph properties
- graph model
- graph mining
- graph classification
- graph data
- graph clustering
- spanning tree
- subgraph isomorphism
- graph databases
- graph search
- pairwise
- random graphs
- graph theoretical
- strongly connected
- minimum spanning tree
- graph kernels
- reachability queries
- directed acyclic graph
- complex networks
- graph transformation
- structural pattern recognition
- finding the shortest path
- graph patterns
- series parallel
- graph partitioning
- graph representations
- query graph
- graph isomorphism
- betweenness centrality
- random walk
- inexact graph matching
- planar graphs
- phase transition
- connected components
- shortest path
- real world graphs
- maximum clique
- similarity scores
- transitive closure
- minimum cost
- massive graphs
- approximation algorithms
- connected dominating set