, 2018 In this paper we consider the graphs having at most two (signless) Laplacian eigenvalues greater than 2. We prove that all these graphs are determined by the spectrum of their Laplacian matrix, and that all these graphs except the star on four vertices ...
Jianfeng Wang +2 more
core
Some sufficient conditions on hamilton graphs with toughness. [PDF]
Front Comput Neurosci, 2022 Cai G, Yu T, Xu H, Yu G.
europepmc +1 more source
Seidel Laplacian and Seidel Signless Laplacian energies of commuting graph for dihedral groups [PDF]
In this paper, we discuss the energy of the commuting graph. The vertex set of the graph is dihedral groups and the edges between two distinct vertices represent the commutativity of the group elements.
Syechah, Bulqis Nebula +3 more
core +1 more source
Signless Laplacian Spectral Conditions for Hamiltonicity of Graphs [PDF]
, 2014 We establish some signless Laplacian spectral radius conditions for a graph to be Hamiltonian or traceable or Hamilton ...
Gaixiang Cai +3 more
core +1 more source
Quantitative structure-properties relationship analysis of Eigen-value-based indices using COVID-19 drugs structure. [PDF]
Int J Quantum Chem, 2023 Rauf A, Naeem M, Hanif A.
europepmc +1 more source
Effects of duplication operations on signless laplacian spectrum and network measures
Boletim da Sociedade Paranaense de MatemáticaThis article investigates the spectral properties of graphs under vertex and edge duplication, analyzing how these operations affect the eigenvalues of Signless Laplacian operators. We derive the spectra for graphs with duplicated vertices and edges, and evaluate key invariants such as Kirchhoff index, global mean-first passage time, and spanning ...
Fareeha Hanif, Ali Raza
openaire +1 more source
Quotient of spectral radius, (signless) Laplacian spectral radius and clique number of graphs [PDF]
, 2002 summary:In this paper, the upper and lower bounds for the quotient of spectral radius (Laplacian spectral radius, signless Laplacian spectral radius) and the clique number together with the corresponding extremal graphs in the class of connected graphs ...
Das, Kinkar Ch. +3 more
core +1 more source
Eigenvalue-based entropy in directed complex networks. [PDF]
PLoS One, 2021 Sun Y, Zhao H, Liang J, Ma X.
europepmc +1 more source
Spectra of Subdivision Vertex-Edge Join of Three Graphs
Mathematics, 2019 In this paper, we introduce a new graph operation called subdivision vertex-edge join (denoted by G 1 S ▹ ( G 2 V ∪ G 3 E ) for short), and then the adjacency spectrum, the Laplacian spectrum and the signless Laplacian spectrum of
Fei Wen, You Zhang, Muchun Li
doaj +1 more source
Albertson (Alb) spectral radii and Albertson (Alb) energies of graph operation. [PDF]
Front Chem, 2023 Munir MM, Wusqa UT.
europepmc +1 more source