A new kind of $A_{\text{p}}$-matrix for mixed graphs

Nikiforov\cite{nikiforov2017merging} introduced the concept of the $A_{\text{p}}$-matrix as a convex linear combination of a graph’s adjacency matrix and its diagonal matrix of vertex degrees. In this paper, we introduce a new variant of the $A_{\text{p}}$-matrix, which is a linear combination of the Hermitian adjacency matrix of the second kind, $H^{\text{om}}$, and the degree-diagonal matrix. This study provides new insights into the $A_{\text{p}}$-matrix as a Hermitian matrix, leading to novel bounds in spectral graph theory.