Pages that link to "Item:Q396825"
From MaRDI portal
The following pages link to A characterization of graphs by codes from their incidence matrices (Q396825):
Displaying 16 items.
- Codes associated with the odd graphs (Q393176) (← links)
- PD-sets for the codes from incidence matrices of triangular graphs (Q1617766) (← links)
- Codes from incidence matrices of graphs (Q1951220) (← links)
- On the number of minimal codewords in codes generated by the adjacency matrix of a graph (Q2065789) (← links)
- Ternary codes from some reflexive uniform subset graphs (Q2254533) (← links)
- Codes from the incidence matrices and line graphs of Hamming graphs \(H^k(n,2)\) for \(k \geq 2\) (Q2275889) (← links)
- Binary codes from Paley graphs of prime-power-square order (Q2329171) (← links)
- Binary codes from reflexive uniform subset graphs on 3-sets (Q2346712) (← links)
- Codes from neighbourhood designs of the graphs \(\text{GP}(q,\frac{q-1}{2})\) with \(q\) odd (Q2364417) (← links)
- Hulls of codes from incidence matrices of connected regular graphs (Q2436579) (← links)
- Codes and coherent partitions in regular graphs (Q3971897) (← links)
- (Q4990142) (← links)
- Codes from incidence matrices of some Bouwer graphs (Q5013474) (← links)
- Isodual and Self-dual Codes from Graphs (Q5862397) (← links)
- The weight distribution of hulls of binary codes from incidence matrices of complete graphs (Q6110368) (← links)
- On some codes from rank 3 primitive actions of the simple Chevalley group \(G_2(q) \) (Q6112230) (← links)