Inverse of \alpha-Hermitian Adjacency Matrix of a Unicyclic Bipartite Graph

arXiv2205.07010MaRDI QIDQ6399145FDOQ6399145

Authors: Mohammad Abudayah, Omar Alomari, O. A. AbuGhneim 

Publication date: 14 May 2022

Abstract: Let $X$ be bipartite mixed graph and for a unit complex number $alpha$, $H_{a}lpha$ be its $alpha$-hermitian adjacency matrix. If $X$ has a unique perfect matching, then $H_{a}lpha$ has a hermitian inverse $H_{a}lph{a}^{-1}$. In this paper we give a full description of the entries of $H_{a}lph{a}^{-1}$ in terms of the paths between the vertices. Furthermore, for $alpha$ equals the primitive third root of unity $gamma$ and for a unicyclic bipartite graph $X$ with unique perfect matching, we characterize when $H_{g}amm{a}^{-1}$ is $pm1$ diagonally similar to $gamma$-hermitian adjacency matrix of a mixed graph. Through our work, we have provided a new construction for the $pm1$ diagonal matrix.

This page was built for publication: Inverse of $\alpha$-Hermitian Adjacency Matrix of a Unicyclic Bipartite Graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6399145)