ɐ ɡˈeɪn ɡɹˈæf ɪz ɐ ɡɹˈæf hˌuːz ˈɛdʒᵻz ɑːɹ lˈeɪbəld "ɪnvˈɜːɾᵻbli", ɔːɹ "ˈoːɹiəntəbli", baɪ ˈɛlɪmənts əvə ɡɹˈuːp dʒˈiː.
A gain graph is a graph whose edges are labelled "invertibly", or "orientably", by elements of a group G.