Transmission-Based Energies of Prime Coprime Graph for Integers Modulo Group
Graphs are an excellent instrument that provides an algebraic structure for visualizing and interpreting molecule structures and characteristics. As a result, the problem statement arises regarding how we can interpret graphs with eigenvalues concerning
Mamika Ujianita Romdhini +3 more
doaj +1 more source
The sun graph is determined by its signless Laplacian spectrum
For a simple undirected graph G, the corresponding signless Laplacian matrix is defined as D(G) + A(G) in which D(G) and A(G) are degree matrix and adjacency matrix of G, respectively.
Mirzakhah, Maryam, Kiani, Dariush
core +1 more source
Albertson (Alb) spectral radii and Albertson (Alb) energies of graph operation. [PDF]
Munir MM, Wusqa UT.
europepmc +1 more source
A decision-making technique under interval-valued Fermatean fuzzy Hamacher interactive aggregation operators. [PDF]
Shahzadi G, Luqman A, Karaaslan F.
europepmc +1 more source
Maxima of the signless Laplacian spectral radius for planar graphs
The signless Laplacian spectral radius of a graph is the largest eigenvalue of its signless Laplacian. In this paper, we prove that the graph $K_{2}\nabla P_{n-2}$ has the maximal signless Laplacian spectral radius among all planar graphs of order $n\geq
Yu, Guanglong +2 more
core +1 more source
Multi-attribute decision-making for electronic waste recycling using interval-valued Fermatean fuzzy Hamacher aggregation operators. [PDF]
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
Graphs with maximum Laplacian and signless Laplacian Estrada index
© 2016 Elsevier B.V. All rights reserved. The Laplacian Estrada index (LEE) and the signless Laplacian Estrada index (SLEE) of a graph G are, respectively, the sum of the exponentials of the eigenvalues of the Laplacian and signless Laplacian matrix of G.
Medina, Luis +3 more
core +1 more source
Dissecting molecular network structures using a network subgraph approach. [PDF]
Huang CH +5 more
europepmc +1 more source
BOUNDS FOR SIGNLESS LAPLACIAN SPECTRAL RADIUS
We consider weighted graphs, such as graphs where the edge weights are positive definite matrices of the same order in this paper. The signless Laplacian eigenvalues of a graph are the eigenvalues of the signless Laplacian matrix of a graph G.
Nurkahli, Semiha Basdas +2 more
core

