






















In this paper, we introduce a matrix for a mixed graph, called the integrated adjacency matrix. This matrix uniquely determines a mixed graph, as long as the indices of the matrix are specified. Additionally, we associate an (undirected) graph with each mixed graph, enabling the spectral analysis of the integrated adjacency matrix to connect the structural properties of the mixed graph and its associated graph. Furthermore, we define certain mixed graph structures and establish their relationships to the eigenvalues of the integrated adjacency matrix.
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。