2022/06/01 by Laura N. Anderson, Ting Su, Anderson, Laura +3
Computer Science · Engineering · #05C22 (Primary) 05B35 #52C35 (Secondary) #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Matrix Theory and Algorithms #graph theory and CDMA systems
paper · pdf · doi:10.48550/arxiv.2206.00237
openalex publication_date 2022/06/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
A signed graph has edge signs. A gain graph has oriented edge gains drawn from a group. We define the combination of the two for the abelian case, in which each oriented edge of a signed graph has a gain from an abelian group, concentrating on the case of the additive group of a field. We develop the elementary graph properties, the associated matroid, and the vector and hyperplanar representations.