Login / Signup

On the number of minimal codewords in codes generated by the adjacency matrix of a graph.

Sascha Kurz
Published in: Discret. Appl. Math. (2022)
Keyphrases
  • adjacency matrix
  • graph representation
  • undirected graph
  • computational complexity
  • directed graph
  • graph model
  • graph partitioning
  • directed acyclic graph
  • edge weights