Determines Laplacian spectra in bipartite signed graphs, indicating key properties of their structure.
In this paper, we determine the Laplacian spectrum and the net Laplacian spectrum of a complete bipartite signed graph whenever its negative edges induce either a matching or a complete bipartite subgraph. Moreover, we deliver the spectrum, the Laplacian spectrum and the net Laplacian characteristic polynomial whenever negative edges induce a double star tree.
No takes yet. Share an insight, caveat, or question.
Pirzada et al. (2025) studied this question.
Synapse has enriched one closely related paper. Consider it for comparative context: