Self-orthogonal codes from the strongly regular graphs on up to 40 vertices.
Dean CrnkovicMarija MaksimovicBernardo Gabriel RodriguesSanja RukavinaPublished in: Adv. Math. Commun. (2016)
Keyphrases
- weighted graph
- labeled graphs
- random graphs
- attributed graphs
- undirected graph
- adjacency matrix
- hamiltonian cycle
- directed edges
- directed graph
- maximal cliques
- connected subgraphs
- graph model
- average degree
- error correction
- graph matching
- maximum cardinality
- spanning tree
- graph representation
- edge weights
- graph structure
- bipartite graph
- space time block codes
- minimum weight
- graph clustering
- graph mining
- graph theory
- pairwise
- series parallel
- error correcting codes
- error correcting
- graph structures
- densely connected
- dimensionality reduction
- connected graphs
- neural network