Inverse of Hermitian adjacency matrix of mixed bipartite graphs

DOI10.1007/978-3-031-52969-6_25zbMATH Open1548.05197MaRDI QIDQ6616833

Omar Alomari

Publication date: 9 October 2024

zbMATH Keywords

digraphspectrumadjacency matrixbipartite graphs

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Directed graphs (digraphs), tournaments (05C20)

Cites Work

• Unnamed Item
• Hermitian-adjacency matrices and Hermitian energies of mixed graphs
• Inverses of trees
• On the N-spectrum of oriented graphs
• The non-negative spectrum of a digraph
• A new kind of Hermitian matrices for digraphs
• Large regular bipartite graphs with median eigenvalue 1
• On the relation between theH-rank of a mixed graph and the matching number of its underlying graph
• The Eigenvalues of a Graph and Its Chromatic Number

This page was built for publication: Inverse of Hermitian adjacency matrix of mixed bipartite graphs