Results 111 to 120 of about 42,138 (164)

Signless Laplacian Spectral Conditions for Hamiltonicity of Graphs

open access: yesJournal 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

On graphs whose signless Laplacian index does not exceed 4.5

open access: yes, 2009
Let AG and DG be respectively the adjacency matrix and the degree matrix of a graph G. The signless Laplacian matrix of G is defined as QG=DG+AG. The Q-spectrum of G is the set of the eigenvalues together with their multiplicities of QG. The Q-index of G
Wang, JianFeng   +6 more
core   +1 more source

A sharp lower bound on the signless Laplacian index of graphs with (κ,τ)-regular sets [PDF]

open access: yes, 2018
A new lower bound on the largest eigenvalue of the signless Laplacian spectra for graphs with at least one (κ,τ)regular set is introduced and applied to the recognition of non-Hamiltonian graphs or graphs without a perfect matching.
Andelic, Milica   +8 more
core   +1 more source

The largest Laplacian and signless Laplacian H-eigenvalues of a uniform hypergraph

open access: yesLinear Algebra and its Applications, 2015
In this paper, we show that the largest Laplacian H-eigenvalue of a $k$-uniform nontrivial hypergraph is strictly larger than the maximum degree when $k$ is even. A tight lower bound for this eigenvalue is given. For a connected even-uniform hypergraph, this lower bound is achieved if and only if it is a hyperstar.
Hu, Shenglong, Qi, Liqun, Xie, Jinshan
openaire   +2 more sources

Ordering Planar Graphs by Their Signless Laplacian Spectral Radii

open access: yesAxioms
A graph is planar if it can be embedded in the plane such that its edges intersect only at their common endpoints. In this paper, we determine the graphs attaining the second and third largest signless Laplacian spectral radii among all planar graphs of ...
Ke Wang   +3 more
doaj   +1 more source

On the Laplacian and signless Laplacian spectrum of a graph with k pairwise co-neighbor vertices

open access: yes
Consider the Laplacian and signless Laplacian spectrum of a graph G of order n, with k pairwise co-neighbor vertices. We prove that the number of shared neighbors is a Laplacian and a signless Laplacian eigenvalue of G with multiplicity at least k− 1.
Martins, Enide A.   +4 more
core   +1 more source

Applications on color (distance) signless laplacian energy of annihilator monic prime graph of commutative rings

open access: yesAin Shams Engineering Journal
In this study, we define the structure formation of the annihilator monic prime graph of commutative rings, whose distinct vertices X and J satisfies a condition annXJ≠annX⋃ann(J), graph is denoted by AMPG(Zn[x]/〈fx〉).
R. Sarathy, J. Ravi Sankar
doaj   +1 more source

H+-EIGENVALUES OF LAPLACIAN AND SIGNLESS LAPLACIAN TENSORS

open access: yes, 2014
We propose a simple and natural definition for the Laplacian and the signless Lapla-cian tensors of a uniform hypergraph. We study their H+-eigenvalues, i.e., H-eigenvalues with non-negative H-eigenvectors, and H++-eigenvalues, i.e., H-eigenvalues with ...
Liqun Qi
core  

On the reduced signless Laplacian spectrum of a degree maximal graph

open access: yes, 2011
For a (simple) graph G, the signless Laplacian of G is the matrix A(G)+D(G), where A(G) is the adjacency matrix and D(G) is the diagonal matrix of vertex degrees of G; the reduced signless Laplacian of G is the matrix Δ(G)+B(G), where B(G) is the reduced
Tam, Bit-Shun; Wu, Shu-Hui   +1 more
core   +1 more source

On the Signless Laplacian ABC-Spectral Properties of a Graph

open access: yesMathematics
In the paper, we introduce the signless Laplacian ABC-matrix Q̃(G)=D¯(G)+Ã(G), where D¯(G) is the diagonal matrix of ABC-degrees and Ã(G) is the ABC-matrix of G. The eigenvalues of the matrix Q̃(G) are the signless Laplacian ABC-eigenvalues of G.
Bilal A. Rather   +2 more
doaj   +1 more source

Home - About - Disclaimer - Privacy