Bipartite subgraphs and the signless Laplacian matrix
From MaRDI portal
Publication:2853195
DOI10.2298/AADM110205006KzbMath1289.05298MaRDI QIDQ2853195
Debdas Paul, Stephen J. Kirkland
Publication date: 18 October 2013
Published in: Applicable Analysis and Discrete Mathematics (Search for Journal in Brave)
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)
Related Items (7)
Weighted microscopic image reconstruction ⋮ Bipartiteness and the least eigenvalue of signless Laplacian of graphs ⋮ On the sign patterns of the smallest signless Laplacian eigenvector ⋮ Weighted microscopic image reconstruction ⋮ Eigenvalue bounds for the signless \(p\)-Laplacian ⋮ Combinatorial Algorithms for Minimizing the Maximum Laplacian and Signless Laplacian Eigenvalues of Weighted Graphs ⋮ The distance Randić matrix of connected graphs
This page was built for publication: Bipartite subgraphs and the signless Laplacian matrix
