The k-generalized Hermitian adjacency matrices for mixed graphs

DOI10.1016/J.DISC.2022.113254zbMATH Open1504.05182OpenAlexW4309339099MaRDI QIDQ2099490FDOQ2099490

Authors: Yuantian Yu, Xianya Geng, Zihan Zhou 

Publication date: 23 November 2022

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2022.113254

Recommendations

• Hermitian-adjacency matrices and Hermitian energies of mixed graphs
• Hermitian adjacency matrix of the second kind for mixed graphs
• Nullity of Hermitian-adjacency matrices of mixed graphs
• Hermitian Laplacian matrix and positive of mixed graphs
• Hermitian-Randić matrix and Hermitian-Randić energy of mixed graphs
• Hermitian adjacency spectrum and switching equivalence of mixed graphs
• The Hermitian Kirchhoff index and robustness of mixed graph
• scientific article; zbMATH DE number 7666851
• On the mixed adjacency matrix of a mixed graph

zbMATH Keywords

mixed graphcospectralityspectral determination\(H_k\)-rank

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• A characterization of graphs with rank 5
• A characterization of graphs with rank 4
• On the spectrum of 3-coloured digraphs
• Spectral properties of complex unit gain graphs
• On weighted directed graphs
• On a conjecture concerning spanning tree invariants and loop systems
• On the nullity of graphs
• Hermitian adjacency matrix of the second kind for mixed graphs
• Hermitian-adjacency matrices and Hermitian energies of mixed graphs
• Hermitian adjacency spectrum and switching equivalence of mixed graphs
• Oriented gain graphs, line graphs and eigenvalues
• Mixed graphs with \(H\)-rank 3
• A characterization of signed planar graphs with rank at most 4
• Unit gain graphs with two distinct eigenvalues and systems of lines in complex space
• Complex unit gain graphs with exactly one positive eigenvalue
• A new kind of Hermitian matrices for digraphs
• Complex unit gain graphs of rank 2
• On the relation between theH-rank of a mixed graph and the matching number of its underlying graph
• Relation between the \(H\)-rank of a mixed graph and the rank of its underlying graph
• The relation between the \(H\)-rank of a mixed graph and the independence number of its underlying graph
• The multiplicity of an \(A_\alpha \)-eigenvalue: a unified approach for mixed graphs and complex unit gain graphs
• Some mixed graphs with \(H\)-rank 4, 6 or 8
• Complex unit gain bicyclic graphs with rank 2, 3 or 4
• The rank of a complex unit gain graph in terms of the rank of its underlying graph
• Balancedness and the least Laplacian eigenvalue of some complex unit gain graphs
• On graphs whose orientations are determined by their Hermitian spectra
• Spectral fundamentals and characterizations of signed directed graphs
• The rank of a complex unit gain graph in terms of the matching number
• Bounds for the rank of a complex unit gain graph in terms of its maximum degree
• Gain distance matrices for complex unit gain graphs
• Bounds on the nullity, the \(H\)-rank and the Hermitian energy of a mixed graph
• On the relation between the adjacency rank of a complex unit gain graph and the matching number of its underlying graph

Cited In (10)

• The index weighted Hermitian adjacency matrices for mixed graphs
• Generalized spectral characterization of mixed graphs
• Some mixed graphs with \(H\)-rank 4, 6 or 8
• Construction of cospectral graphs, signed graphs and \(\mathbb{T}\)-gain graphs via partial transpose
• Hermitian-adjacency matrices and Hermitian energies of mixed graphs
• On symmetric spectra of Hermitian adjacency matrices for non-bipartite mixed graphs
• Title not available (Why is that?)
• The Hermitian Kirchhoff index and robustness of mixed graph
• Hermitian adjacency matrix of the second kind for mixed graphs
• More on minors of Hermitian (quasi-)Laplacian matrix of the second kind for mixed graphs

This page was built for publication: The \(k\)-generalized Hermitian adjacency matrices for mixed graphs

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