On Two Laplacian Matrices for Skew Gain Graphs
Abstract
Let G=(V,E) be a graph with some prescribed orientation for the edges and be an arbitrary group. If f∈ Inv() be an anti-involution then the skew gain graph f=(G,,,f) is such that the skew gain function :E→ satisfies (vu)=f((uv)). In this paper, we study two different types, Laplacian and g-Laplacian matrices for a skew gain graph where the skew gains are taken from the multiplicative group F× of a field F of characteristic zero. Defining incidence matrix, we also prove the matrix tree theorem for skew gain graphs in the case of the g-Laplacian matrix.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.