Results 101 to 110 of about 63,846 (213)
The signless Laplacian separator of graphs [PDF]
The Electronic Journal of Linear Algebra, 2011 The signless Laplacian separator of a graph is defined as the difference between the largest eigenvalue and the second largest eigenvalue of the associated signless Laplacian matrix. In this paper, we determine the maximum signless Laplacian separators of unicyclic, bicyclic and tricyclic graphs with given order.
Zhifu You, Bolian Liu
openaire +1 more source
Cospectral constructions for several graph matrices using cousin vertices
Special Matrices, 2021 Graphs can be associated with a matrix according to some rule and we can find the spectrum of a graph with respect to that matrix. Two graphs are cospectral if they have the same spectrum.
Lorenzen Kate
doaj +1 more source
Distribution of signless Laplacian eigenvalues and graph invariants [PDF]
, 2023 Leyou Xu, Bo Zhou
openalex +1 more source
Ordering cacti with signless Laplacian spread
The Electronic Journal of Linear Algebra, 2018 A cactus is a connected graph in which any two cycles have at most one vertex in common. The signless Laplacian spread of a graph is defined as the difference between the largest eigenvalue and the smallest eigenvalue of the associated signless Laplacian matrix. In this paper, all cacti of order n with signless Laplacian spread greater than or equal to
Lin, Zhen, Guo, Shu-Guang
openaire +2 more sources
Bounding the sum of the largest signless Laplacian eigenvalues of a graph [PDF]
, 2022 Aida Abiad +4 more
openalex +1 more source
Spectra of the extended neighborhood corona and extended corona of two graphs
Electronic Journal of Graph Theory and Applications, 2016 In this paper we define extended corona and extended neighborhoodcorona of two graphs $G_{1}$ and $G_{2}$, which are denoted by$G_{1}\bullet G_{2}$ and $G_{1}\ast G_{2}$ respectively.
Chandrashekar Adiga +2 more
doaj +1 more source
Universal Adjacency Matrices with Two Eigenvalues [PDF]
AMS Mathematics Subject Classification: 05C50.Adjacency matrix;Universal adjacency matrix;Laplacian matrix;signless Laplacian;Graph spectra;Eigenvalues;Strongly regular ...
Haemers, W.H., Omidi, G.R.
core +1 more source
Maximality of the signless Laplacian energy
Discrete Mathematics, 2018 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lucélia Kowalski Pinheiro +1 more
openaire +2 more sources
Spectral Results on Some Hamiltonian Properties of Graphs [PDF]
Romanian Journal of Mathematics and Computer Science, 2014 Using Lotker’s interlacing theorem on the Laplacian eigenvalues of a graph in [5] and Wang and Belardo’s interlacing theorem on the signless Laplacian eigenvalues of a graph in [6], we in this note obtain spectral conditions for some Hamiltonian ...
Rao Li
doaj
Signless Laplacian Spectral Conditions for Hamiltonicity of Graphs
Journal of Applied Mathematics, 2014 We establish some signless Laplacian spectral radius conditions for a graph to be Hamiltonian or traceable or Hamilton-connected.
Guidong Yu +3 more
doaj +1 more source