On two Laplacian matrices for skew gain graphs

Gain graphs are graphs where the edges are given some orientation and labeled with the elements (called gains) from a group so that gains are inverted when we reverse the direction of the edges. Generalizing the notion of gain graphs, skew gain graphs have the property that the gain of a reversed ed...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Electronic journal of graph theory and applications 2021-01, Vol.9 (1), p.125-135
Hauptverfasser: Roy, Roshni T., Hameed K., Shahul, K.A., Germina
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Gain graphs are graphs where the edges are given some orientation and labeled with the elements (called gains) from a group so that gains are inverted when we reverse the direction of the edges. Generalizing the notion of gain graphs, skew gain graphs have the property that the gain of a reversed edge is the image of edge gain under an anti-involution. 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 Fx 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.  
ISSN:2338-2287
2338-2287
DOI:10.5614/ejgta.2021.9.1.12