On the determinant of the Laplacian matrix of a complex unit gain graph
From MaRDI portal
Publication:2411597
DOI10.1016/j.disc.2017.07.003zbMath1372.05097OpenAlexW2739914937MaRDI QIDQ2411597
Shi-Cai Gong, Yi Wang, Yi-Zheng Fan
Publication date: 24 October 2017
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2017.07.003
Related Items
Principal Minors of Hermitian (Quasi-)Laplacian Matrix of Second Kind for Mixed Graphs ⋮ Bounds for the rank of a complex unit gain graph in terms of the independence number ⋮ On the relation between the adjacency rank of a complex unit gain graph and the matching number of its underlying graph ⋮ On the adjacency matrix of a complex unit gain graph ⋮ Complex unit gain graphs of rank 2 ⋮ The rank of a complex unit gain graph in terms of the matching number ⋮ Unnamed Item ⋮ The multiplicity of an \(A_\alpha \)-eigenvalue: a unified approach for mixed graphs and complex unit gain graphs ⋮ Inertia indices of a complex unit gain graph in terms of matching number ⋮ The spectral property of hypergraph coverings ⋮ NEPS of complex unit gain graphs ⋮ On connected \(\mathbb{T}\)-gain graphs with rank equal to girth ⋮ Unnamed Item ⋮ Complex unit gain graphs with exactly one positive eigenvalue ⋮ Bounds for the rank of a complex unit gain graph in terms of its maximum degree ⋮ Spectra of quaternion unit gain graphs ⋮ Bounds for the extremal eigenvalues of gain Laplacian matrices ⋮ Unnamed Item ⋮ Balancedness and the least Laplacian eigenvalue of some complex unit gain graphs ⋮ GRAPHS DETERMINED BY THEIR -GAIN SPECTRA
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Spectral properties of complex unit gain graphs
- The characteristic polynomial and the matchings polynomial of a weighted oriented graph
- Skew-adjacency matrices of graphs
- On products and line graphs of signed graphs, their eigenvalues and energy
- On weighted directed graphs
- 3-regular digraphs with optimum skew energy
- Balance in gain graphs - a spectral analysis
- Bicyclic oriented graphs with skew-rank 6
- Biased graphs. I: Bias, balance, and gains
- Signed graph coloring
- Erratum to: T. Zaslavsky, signed graphs
- Biased graphs. II: The three matroids
- Orientation of signed graphs
- Biased graphs IV: Geometrical realizations
- Ordering of oriented unicyclic graphs by skew energies
- Biased graphs. III: Chromatic and dichromatic invariants
- The skew energy of a digraph
- Skew spectra of oriented graphs
- Bounds for the least Laplacian eigenvalue of a signed graph
- Matrices in the Theory of Signed Simple Graphs
- An upper bound on the Laplacian spectral radius of the signed graphs
- Matrix Analysis
- Generalized matrix tree theorem for mixed graphs
- A Combinatorial Proof of the All Minors Matrix Tree Theorem
- On the Laplacian Eigenvalues of Signed Graphs
- A bidirected generalization of network matrices
