scientific article; zbMATH DE number 7583264
From MaRDI portal
Publication:5104000
DOI10.22108/toc.2021.130013.1888MaRDI QIDQ5104000
Maurizio Brunetti, Francesco Belardo
Publication date: 9 September 2022
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Signed and weighted graphs (05C22) Graph operations (line graphs, products, etc.) (05C76)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Signed line graphs with least eigenvalue -2: the star complement technique
- On eigenspaces of some compound signed graphs
- Spectral properties of complex unit gain graphs
- Oriented gain graphs, line graphs and eigenvalues
- Biased graphs. I: Bias, balance, and gains
- A mathematical bibliography of signed and gain graphs and allied areas
- Signed bicyclic graphs minimizing the least Laplacian eigenvalue
- Bounds for the extremal eigenvalues of gain Laplacian matrices
- A group representation approach to balance of gain graphs
- Spectral fundamentals and characterizations of signed directed graphs
- Characterizations of line graphs in signed and gain graphs
- On cospectrality of gain graphs
- The rank of a complex unit gain graph in terms of the matching number
- The multiplicity of an \(A_\alpha \)-eigenvalue: a unified approach for mixed graphs and complex unit gain graphs
- Complex unit gain graphs with exactly one positive eigenvalue
- Gain-line graphs via \(G\)-phases and group representations
- Godsil-McKay switching for mixed and gain graphs over the circle group
- Balancedness and the least Laplacian eigenvalue of some complex unit gain graphs
- A new kind of Hermitian matrices for digraphs
- On the determinant of the Laplacian matrix of a complex unit gain graph
- Large regular bipartite graphs with median eigenvalue 1
- Total graph of a signed graph
- Graphs with least eigenvalue \(-2\): The star complement technique
This page was built for publication:
