Results 51 to 60 of about 63,846 (213)
A novel method to construct cospectral graphs based on RT operation [PDF]
This paper presents a new graph operation, RT(G), which is formed by transforming each vertex and edge of the original graph G into a triangle. We analyze the relationship between the signless Laplacian characteristic polynomials of the graph RT(G) and ...
Xiu-Jian Wang +2 more
doaj +1 more source
Signless Laplacian Energy of Interval-Valued Fuzzy Graph and its Applications
An interval-valued fuzzy graph (IVFG) emanates from a fuzzy graph (FG) where the membership is given in interval form. This framework give the user more flexibility in dealing with fuzzy information.
M. Romdhini +4 more
semanticscholar +1 more source
Principal eigenvector of the signless Laplacian matrix [PDF]
In this paper, we study the entries of the principal eigenvector of the signless Laplacian matrix of a hypergraph. More precisely, we obtain bounds for this entries. These bounds are computed trough other important parameters, such as spectral radius, maximum and minimum degree.
openaire +2 more sources
On distance signless Laplacian spectrum and energy of graphs
The distance signless Laplacian spectral radius of a connected graph G is the largest eigenvalue of the distance signless Laplacian matrix of G, defined as DQ(G) = Tr(G) + D(G), where D(G) is the distance matrix of G and Tr(G) is the diagonal ...
Abdollah Alhevaz +2 more
doaj +1 more source
The signless Laplacian eigenvalues of a graph $G$ are eigenvalues of the matrix $Q(G) = D(G) + A(G)$, where $D(G)$ is the diagonal matrix of the degrees of the vertices in $G$ and $A(G)$ is the adjacency matrix of $G$.
Rao Li
doaj +1 more source
ON THE SPECTRAL CHARACTERISTICS OF SIGNLESS LAPLACIAN MATRIX [PDF]
Pallabi Bora, M. M. Rahman
openalex +2 more sources
Majorization bounds for signless Laplacian eigenvalues
It is known that, for a simple graph G and a real number , the quantity s0 (G) is defined as the sum of the -th power of non-zero singless Laplacian eigenvalues of G. In this paper, first some majorization bounds over s 0(G) are presented in terms of the degree sequences, and number of vertices and edges of G. Additionally, a connection between s 0(G)
Maden, A. Dilek, Cevik, A. Sinan
openaire +2 more sources
Constructing non-isomorphic signless Laplacian cospectral graphs [PDF]
In this article, we generate large families of non-isomorphic and signless Lalacian cospectral graphs using partial transpose on graphs. Our constructions are significantly powerful. More than $70\%$ of non-isomorphic signless-Laplacian cospectral graphs can be generated with partial transpose when number of vertices is $\le 8$.
openaire +2 more sources
A Sharp upper bound for the spectral radius of a nonnegative matrix and applications [PDF]
In this paper, we obtain a sharp upper bound for the spectral radius of a nonnegative matrix. This result is used to present upper bounds for the adjacency spectral radius, the Laplacian spectral radius, the signless Laplacian spectral radius, the ...
Shu, Yujie, You, Lihua, Zhang, Xiao-Dong
core +2 more sources
Topological Indices of Certain Transformed Chemical Structures
Topological indices like generalized Randić index, augmented Zagreb index, geometric arithmetic index, harmonic index, product connectivity index, general sum‐connectivity index, and atom‐bond connectivity index are employed to calculate the bioactivity of chemicals.
Xuewu Zuo +5 more
wiley +1 more source

