Some Results on the Signless Laplacian Spectra of Unicyclic Graphs [PDF]
, 2011 We determine the second to fourth largest (resp. the second smallest) signless Laplacian spectral radii and the second to fourth largest signless Laplacian spreads together with the corresponding graphs in the class of unicyclic graphs with n vertices ...
Muhuo Liu
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
Strengthening container shipping network connectivity during COVID-19: A graph theory approach. [PDF]
Ocean Coast Manag, 2022 Pan JJ, Zhang YF, Fan B.
europepmc +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
On the second largest eigenvalue of the signless Laplacian
, 2013 Let G be a graph of order n, and let q1(G)≥⋯≥q n(G) be the eigenvalues of the Q-matrix of G, also known as the signless Laplacian of G. We give a necessary and sufficient condition for the equality qk(G)=n-2, where
Nikiforov, Vladimir +1 more
core +1 more source
A decision-making technique under interval-valued Fermatean fuzzy Hamacher interactive aggregation operators. [PDF]
Soft comput, 2023 Shahzadi G, Luqman A, Karaaslan F.
europepmc +1 more source
Comparison of Different Properties of Graph Using Adjacency Matrix and Signless Laplacian Matix
International Journal of Scientific Research in Science, Engineering and TechnologyThis study highlights the advantages of using the Signless Laplacian spectrum over the traditional Adjacency matrix spectrum for graph representation. It demonstrates that the Signless Laplacian possesses greater representational power and stronger characterization properties, making it a more effective tool for analyzing graph structures. Particularly,
Sahrawat, Km. Priti, Kumar, Ashish
openaire +1 more source
On Zagreb index, signless Laplacian eigenvalues and signless Laplacian energy of a graph
, 2022 Let $G$ be a simple graph with order $n$ and size $m$. The quantity $M_1(G)=\displaystyle\sum_{i=1}^{n}d^2_{v_i}$ is called the first Zagreb index of $G$, where $d_{v_i}$ is the degree of vertex $v_i$, for all $i=1,2,\dots,n$.
Pirzada, S., Khan, Saleem
core
Multi-attribute decision-making for electronic waste recycling using interval-valued Fermatean fuzzy Hamacher aggregation operators. [PDF]
Granul Comput, 2023 Luqman A, Shahzadi G.
europepmc +1 more source
Bounds for the signless laplacian energy
The energy of a graph G is the sum of the absolute values of the eigenvalues of the adjacency matrix of G. The Laplacian (respectively, the signless Laplacian) energy of G is the sum of the absolute values of the differences between the eigenvalues of ...
Gutman, I. +4 more
core