Strongly regular graphs decomposable into a divisible design graph and a Hoffman coclique.
Alexander L. GavrilyukVladislav V. KabanovPublished in: Des. Codes Cryptogr. (2024)
Keyphrases
- graph theory
- directed graph
- graph representation
- graph matching
- case study
- graph transformation
- random walk
- graph theoretic
- spanning tree
- weighted graph
- graph mining
- graph databases
- labeled graphs
- subgraph isomorphism
- graph structure
- link prediction
- connected components
- social networks
- graph partitioning
- bipartite graph
- graph clustering
- random graphs
- graph construction
- adjacency matrix
- graph theoretical
- design process
- maximum clique
- user interface
- structural pattern recognition