A characterization of graphs by codes from their incidence matrices
From MaRDI portal
Publication:396825
zbMath1295.05142MaRDI QIDQ396825
Bernardo Gabriel Rodrigues, Peter Dankelmann, Jennifer D. Key
Publication date: 14 August 2014
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v20i3p18
05B20: Combinatorial aspects of matrices (incidence, Hadamard, etc.)
94B05: Linear codes (general theory)
05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)
05C40: Connectivity
Related Items
Unnamed Item, Isodual and Self-dual Codes from Graphs, On some codes from rank 3 primitive actions of the simple Chevalley group \(G_2(q) \), Codes associated with the odd graphs, Ternary codes from some reflexive uniform subset graphs, Binary codes from Paley graphs of prime-power-square order, Binary codes from reflexive uniform subset graphs on 3-sets, Codes from neighbourhood designs of the graphs \(\text{GP}(q,\frac{q-1}{2})\) with \(q\) odd
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- On super 2-restricted and 3-restricted edge-connected vertex transitive graphs
- Super restricted edge connectivity of regular edge-transitive graphs
- Sufficient conditions for triangle-free graphs to be optimally restricted edge-connected
- Codes from incidence matrices and line graphs of Paley graphs
- Codes from lattice and related graphs, and permutation decoding
- Codes associated with triangular graphs and permutation decoding
- On super restricted edge-connectivity of edge-transitive graphs
- Codes from incidence matrices and line graphs of Hamming graphs
- Diameter-sufficient conditions for a graph to be super-restricted connected
- Minimum words of codes from affine planes
- Sufficient conditions for bipartite graphs to be super-\(k\)-restricted edge connected
- Radius, diameter, and minimum degree
- Superconnectivity of bipartite digraphs and graphs
- The Magma algebra system. I: The user language
- Codes from adjacency matrices of uniform subset graphs
- Super restricted edge-connectivity of vertex-transitive graphs
- Eigenvalues and perfect matchings
- Bipartite graphs and digraphs with maximum connectivity
- On super restricted edge connectivity of half vertex transitive graphs
- Codes from incidence matrices of graphs
- Codes from the incidence matrices and line graphs of Hamming graphs \(H^k(n,2)\) for \(k \geq 2\)
- Super restricted edge connectivity of regular graphs
- Neighborhood conditions for graphs to be super restricted edge connected
- On super-edge-connected digraphs and bipartite digraphs
- Sufficient conditions for graphs to be ??-optimal, super-edge-connected, and maximally edge-connected
- Graph theoretic error-correcting codes
- Asymptotic Formulas for the Probability of k-Connectedness of Random Graphs
