On the structure of matroids arising from the gain graphs

DOI10.1016/j.disc.2023.113637zbMath1522.05178OpenAlexW4386096638MaRDI QIDQ6056730

Hamid Reza Maimani, M. Poursoltani, L. Parsaei-Majd, M. R. Pournaki

Publication date: 4 October 2023

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2023.113637

zbMATH Keywords

simplicial complexmatroidsigned graphgain graphgeneralized Hamming weight

Mathematics Subject Classification ID

Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Linear codes (general theory) (94B05) Combinatorial aspects of matroids and geometric lattices (05B35) Signed and weighted graphs (05C22) Combinatorial aspects of simplicial complexes (05E45)

Cites Work

• Unnamed Item
• Wei-type duality theorems for matroids
• Biased graphs. I: Bias, balance, and gains
• A generalization of weight polynomials to matroids
• Biased graphs. II: The three matroids
• Biased graphs IV: Geometrical realizations
• Combinatorics and commutative algebra.
• Hamming weights and Betti numbers of Stanley-Reisner rings associated to matroids
• Codes from incidence matrices of graphs
• Generalized star configurations and the Tutte polynomial
• Linear codes over signed graphs
• Generalized Hamming weights for linear codes
• Generalized Hamming Weights for Almost Affine Codes