Spectra, signless Laplacian and Laplacian spectra of complementary prisms of graphs
From MaRDI portal
Publication:1638005
DOI10.1016/j.laa.2018.01.020zbMath1388.05111OpenAlexW2790647722WikidataQ130140849 ScholiaQ130140849MaRDI QIDQ1638005
Maria Aguieiras A. de Freitas, Cybele T. M. Vinagre, Paula A. A. B. Carvalho, Domingos Moreira Cardoso
Publication date: 12 June 2018
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10773/22565
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Graph operations (line graphs, products, etc.) (05C76)
Related Items
A note on the convexity number of the complementary prisms of trees ⋮ Characterizing threshold graphs with \(k\) main signless Laplacian eigenvalues ⋮ The core of a complementary prism ⋮ The core of a vertex-transitive complementary prism ⋮ Geometric and topological properties of the complementary prism networks ⋮ Injective coloring of complementary prism and generalized complementary prism graphs ⋮ On the General Position Number of Complementary Prisms ⋮ Sharp error estimates of a spectral Galerkin method for a diffusion-reaction equation with integral fractional Laplacian on a disk
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A linear eigenvalue algorithm for the nonlinear eigenvalue problem
- Complexity properties of complementary prisms
- Domination and total domination in complementary prisms
- The Gewirtz graph: An exercise in the theory of graph spectra
- An Arnoldi method for nonlinear eigenvalue problems
- Some results on graph spectra
- Cycles in complementary prisms
- Nonlinear eigenvalue problems: a challenge for modern eigenvalue methods
- On the main signless Laplacian eigenvalues of a graph
- The principle of minimized iterations in the solution of the matrix eigenvalue problem