Abstract

The gain graphs are essential generalizations of the signed graphs. They are indeed directed graphs whose edges are labeled by the elements of a group rather than just ±1. In this paper, we prove the existence of matroids arising from these graphs. Further, we study the structure of the obtained matroids as well as their relation with the generalized Hamming weights, the regularity of the ideal of circuits, and the codes.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call