English

On Two Laplacian Matrices for Skew Gain Graphs

Combinatorics 2020-09-23 v1

Abstract

Let G=(V,E)G=(V,\overrightarrow{E}) be a graph with some prescribed orientation for the edges and Γ\Gamma be an arbitrary group. If fInv(Γ)f\in \mathrm{Inv}(\Gamma) be an anti-involution then the skew gain graph Φf=(G,Γ,φ,f)\Phi_f=(G,\Gamma,\varphi,f) is such that the skew gain function φ:EΓ\varphi:\overrightarrow{E}\rightarrow \Gamma satisfies φ(vu)=f(φ(uv))\varphi(\overrightarrow{vu})=f(\varphi(\overrightarrow{uv})). In this paper, we study two different types, Laplacian and gg-Laplacian matrices for a skew gain graph where the skew gains are taken from the multiplicative group F×F^\times of a field FF of characteristic zero. Defining incidence matrix, we also prove the matrix tree theorem for skew gain graphs in the case of the gg-Laplacian matrix.

Keywords

Cite

@article{arxiv.2009.10487,
  title  = {On Two Laplacian Matrices for Skew Gain Graphs},
  author = {Roshni T Roy and Shahul Hameed K and Germina K A},
  journal= {arXiv preprint arXiv:2009.10487},
  year   = {2020}
}

Comments

15 pages

R2 v1 2026-06-23T18:43:01.955Z