On two Laplacian matrices for skew gain graphs

Abstract: Let

G = (V, o v e r r i g h t a r r o w E)

be a graph with some prescribed orientation for the edges and

G a m m a

be an arbitrary group. If

f i n m a t h r m I n v (G a m m a)

be an anti-involution then the skew gain graph

P h i_{f} = (G, G a m m a, v a r p h i, f)

is such that the skew gain function

v a r p h i : o v e r r i g h t a r r o w E i g h t a r r o w G a m m a

satisfies

v a r p h i (o v e r r i g h t a r r o w v u) = f (v a r p h i (o v e r r i g h t a r r o w u v))

. 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^{i} m e s

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.

Recommendations

Cites Work

Cited In (8)

This page was built for publication: On two Laplacian matrices for skew gain graphs