Results 1 to 10 of about 42,138 (164)
On Distance Signless Laplacian Spectral Radius and Distance Signless Laplacian Energy [PDF]
Mathematics, 2020 In this article, we find sharp lower bounds for the spectral radius of the distance signless Laplacian matrix of a simple undirected connected graph and we apply these results to obtain sharp upper bounds for the distance signless Laplacian energy graph.
Hans Nina +2 more
exaly +4 more sources
Some inequalities involving the distance signless Laplacian eigenvalues of graphs [PDF]
Transactions on Combinatorics, 2021 Given a simple graph $G$, the distance signlesss Laplacian $D^{Q}(G)=Tr(G)+D(G)$ is the sum of vertex transmissions matrix $Tr(G)$ and distance matrix $D(G)$.
Abdollah Alhevaz +3 more
doaj +3 more sources
NEW BOUNDS AND EXTREMAL GRAPHS FOR DISTANCE SIGNLESS LAPLACIAN SPECTRAL RADIUS [PDF]
Journal of Algebraic Systems, 2021 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 $D^{Q}(G)=Tr(G)+D(G)$, where $D(G)$ is the distance matrix of $G$ and $Tr(G)$ is the diagonal ...
A. Alhevaz, M. Baghipur, S. Paul
doaj +1 more source
A study on determination of some graphs by Laplacian and signless Laplacian permanental polynomials
AKCE International Journal of Graphs and Combinatorics, 2023 The permanent of an n × n matrix [Formula: see text] is defined as [Formula: see text] where the sum is taken over all permutations σ of [Formula: see text] The permanental polynomial of M, denoted by [Formula: see text] is [Formula: see text] where In ...
Aqib Khan +2 more
doaj +1 more source
Chromatic number and signless Laplacian spectral radius of graphs [PDF]
Transactions on Combinatorics, 2022 For any simple graph $G$, the signless Laplacian matrix of $G$ is defined as $D(G)+A(G)$, where $D(G)$ and $A(G)$ are the diagonal matrix of vertex degrees and the adjacency matrix of $G$, respectively.
Mohammad Reza Oboudi
doaj +1 more source
On the Signless Laplacian Eigenvalues and Optimum SLE of Graph
Fuzzy Optimization and Modeling, 2022 Let G be a graph of order n and with the vertex set {v_1,v_2,…,v_n } and the edge set E(G). The adjancency matrix of G is an n×n matrix A(G) whose (i,j)-entry is 1 if v_i is adjacent to v_j and 0, otherwise.
Gholam Hossein Fath-Tabar
doaj +1 more source
Journal of Mathematics, 2021 Let G be a graph with n vertices, and let LG and QG denote the Laplacian matrix and signless Laplacian matrix, respectively. The Laplacian (respectively, signless Laplacian) permanental polynomial of G is defined as the permanent of the characteristic ...
Tingzeng Wu, Tian Zhou
doaj +1 more source
The gamma-Signless Laplacian Adjacency Matrix of Mixed Graphs
Theory and Applications of Graphs, 2023 The α-Hermitian adjacency matrix Hα of a mixed graph X has been recently introduced. It is a generalization of the adjacency matrix of unoriented graphs. In this paper, we consider a special case of the complex number α.
Omar Alomari +2 more
doaj +1 more source
The normalized signless laplacian estrada index of graphs [PDF]
Transactions on Combinatorics, 2023 Let $G$ be a simple connected graph of order $n$ with $m$ edges. Denote by $% \gamma _{1}^{+}\geq \gamma _{2}^{+}\geq \cdots \geq \gamma _{n}^{+}\geq 0$ the normalized signless Laplacian eigenvalues of $G$. In this work, we define the normalized signless
Ş. Burcu Bozkurt Altındağ +3 more
doaj +1 more source
Distance (signless) Laplacian spectrum of dumbbell graphs [PDF]
Transactions on Combinatorics, 2023 In this paper, we determine the distance Laplacian and distance signless Laplacian spectrum of generalized wheel graphs and a new class of graphs called dumbbell graphs.
Sakthidevi Kaliyaperumal +1 more
doaj +1 more source