Graph products and the chromatic difference sequence of vertex-transitive graphs.
Claude TardifPublished in: Discret. Math. (1998)
Keyphrases
- labeled graphs
- directed graph
- undirected graph
- edge weights
- attributed graphs
- hamiltonian cycle
- vertex set
- maximum cardinality
- average degree
- weighted graph
- graph structure
- graph representation
- graph matching
- graph theory
- graph databases
- bipartite graph
- graph properties
- graph construction
- adjacency matrix
- graph structures
- connected subgraphs
- spanning tree
- graph mining
- graph clustering
- graph model
- graph theoretic
- betweenness centrality
- random graphs
- dynamic graph
- graph data
- graph kernels
- series parallel
- graph patterns
- approximation algorithms
- random walk
- graph partitioning
- subgraph isomorphism
- graph classification
- graph representations
- strongly connected
- minimum weight
- directed acyclic
- finding the shortest path
- connected dominating set
- graph search
- temporal sequences
- web graph
- maximum clique
- complex networks
- directed acyclic graph
- structural pattern recognition
- reachability queries
- graph drawing
- connected components
- phase transition
- minimum cost
- graph theoretical
- polynomial time complexity
- graph isomorphism
- minimum spanning tree
- real world graphs
- neighborhood graph
- dense subgraphs
- graph transformation
- inexact graph matching
- shortest path