Perfect 3-colorings of the Johnson graphs J(4, 2), J(5, 2), J(6, 2) and Petersen graph.
Mohammad Hadi AlaeiyanAmirabbas AbediPublished in: Ars Comb. (2018)
Keyphrases
- graph representation
- graph theory
- directed graph
- graph structure
- graph matching
- weighted graph
- graph structures
- graph mining
- graph construction
- labeled graphs
- graph theoretic
- graph databases
- graph properties
- graph theoretical
- graph clustering
- graph partitioning
- graph classification
- random graphs
- series parallel
- graph model
- dynamic graph
- subgraph isomorphism
- structural pattern recognition
- bipartite graph
- graph search
- adjacency matrix
- graph isomorphism
- graph transformation
- spanning tree
- directed acyclic
- finding the shortest path
- graph data
- web graph
- graph representations
- adjacency graph
- real world graphs
- dense subgraphs
- graph drawing
- inexact graph matching
- evolving graphs
- maximum clique
- graph patterns
- undirected graph
- average degree
- topological information
- reachability queries
- spectral decomposition
- structured data
- social graphs
- minimum spanning tree
- graph kernels
- neighborhood graph
- connected graphs
- edge weights
- random walk
- massive graphs
- bounded treewidth
- disk resident
- query graph
- graph embedding
- fully connected
- connected components
- proximity graph
- graph layout
- attributed graphs
- planar graphs
- maximum independent set