Results 81 to 90 of about 7,057,923 (115)
BOUNDS FOR SIGNLESS LAPLACIAN SPECTRAL RADIUS
, 2018 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
Sharp upper bounds on the distance energies of a graph
, 2018 Roberto C. Díaz, O. Rojo
semanticscholar +1 more source
Common neighborhood (signless) Laplacian spectrum and energy of CCC-graph
In this paper, we consider commuting conjugacy class graph (abbreviated as CCC-graph) of a finite group $G$ which is a graph with vertex set $\{x^G : x \in G \setminus Z(G)\}$ (where $x^G$ denotes the conjugacy class containing $x$) and two distinct ...
Nath, Rajat Kanti, Jannat, Firdous Ee
core
Discrete Mathematics, Algorithms and Applications, 2018 The distance signless Laplacian spectral radius of a connected graph [Formula: see text] is the largest eigenvalue of the distance signless Laplacian matrix of [Formula: see text], defined as [Formula: see text], where [Formula: see text] is the distance
A. Alhevaz, M. Baghipur, Somnath Paul
semanticscholar +4 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
On the Sum of the Powers of Distance Signless Laplacian Eigenvalues of Graphs
Indian Journal of Pure and Applied Mathematics, 2020S. Pirzada +3 more
semanticscholar +4 more sources
On the Second-Largest Reciprocal Distance Signless Laplacian Eigenvalue [PDF]
Mathematics, 2021 The signless Laplacian reciprocal distance matrix for a simple connected graph G is defined as RQ(G)=diag(RH(G))+RD(G). Here, RD(G) is the Harary matrix (also called reciprocal distance matrix) while diag(RH(G)) represents the diagonal matrix of the ...
Modjtaba Ghorbani +2 more
exaly +2 more sources
On the distance signless Laplacian Estrada index of graphs
Asian-European Journal of Mathematics, 2021The distance signless Laplacian eigenvalues [Formula: see text] of a connected graph [Formula: see text] are the eigenvalues of the distance signless Laplacian matrix of [Formula: see text], defined as [Formula: see text], where [Formula: see text] is ...
A. Alhevaz +3 more
semanticscholar +1 more source
On generalized distance spectral radius and generalized distance energy of graphs
Discret. Math. Algorithms Appl., 2022For a simple connected graph [Formula: see text], let [Formula: see text] and [Formula: see text] be the distance matrix and the diagonal matrix of the vertex transmissions, respectively. The convex linear combination [Formula: see text] of [Formula: see
Zia Ullah Khan, Xiao-Dong Zhang
semanticscholar +1 more source
Bounds for peripheral distance signless Laplacian eigenvalues of graphs
Asian-European Journal of Mathematics, 2020The eccentricity of a vertex [Formula: see text] in a graph [Formula: see text] is the maximum distance between [Formula: see text] and any other vertex of [Formula: see text] A vertex with maximum eccentricity is called a peripheral vertex.
A. Alhevaz +3 more
semanticscholar +1 more source
Distance (signless) Laplacian spectra and energies of two classes of cyclic polyomino chains
Applied Mathematics and ComputationYong-Hong Zhang, Ligong Wang
semanticscholar +3 more sources