Results 41 to 50 of about 7,057,923 (115)
The signless Laplacian spread [PDF]
, 2010 The signless Laplacian spread of G is defined as SQ(G)=μ1(G)-μn(G), where μ1(G) and μn(G) are the maximum and minimum eigenvalues of the signless Laplacian matrix of G, respectively. This paper presents some upper and lower bounds for SQ(G).
Liu, Bolian, Liu, Muhuo
core +1 more source
On maximum degree (signless) Laplacian matrix of a graph
, 2022 Let G be a simple graph on n vertices and v1, v2, . . . , vn be the vertices ofG. We denote the degree of a vertex vi in G by dG(vi) = di. The maximumdegree matrix of G, denoted by M(G), is the real symmetric matrix withits ijth entry equal to max{di, dj}
Raghu, V. D. +2 more
core +1 more source
Further results on the distance signless Laplacian spectrum of graphs
, 2018 The distance signless Laplacian matrix [Formula: see text] of a connected graph [Formula: see text] is defined as [Formula: see text], where [Formula: see text] is the distance matrix of [Formula: see text] and [Formula: see text] is the diagonal matrix
Abdollah Alhevaz +2 more
core +1 more source
On distance Laplacian energy in terms of graph invariants
, 2023 summary:For a simple connected graph $G$ of order $n$ having distance Laplacian eigenvalues $ \rho ^{L}_{1}\geq \rho ^{L}_{2}\geq \cdots \geq \rho ^{L}_{n}$, the distance Laplacian energy ${\rm DLE} (G)$ is defined as ${\rm DLE} (G)=\sum _{i=1}^{n}|\rho ^
Rather, Bilal A. +3 more
core +1 more source
Spektrum Distance Laplacian dan Distance Signless Laplacian pada Graf Bipartit Lengkap (K_(n,n) ) dan Graf Tripartit Lengkap (K_(n,n,n) ) [PDF]
, 2023 Susunan nilai eigen dari matriks ketetanggaan beserta multiplisitasnya disebut spektrum graf. Spektrum graf yang dihasilkan dari matriks distance Laplacian disebut sebagai spektrum distance Laplacian, sedangkan spektrum yang dihasilkan dari matriks ...
RAMADANI, Dian
core
Distance matrices on the H-join of graphs: A general result and applications
Linear Algebra and its Applications, 2018 Given a graph H with vertices 1 , … , s and a set of pairwise vertex disjoint graphs G 1 , … , G s , the vertex i of H is assigned to G i . Let G be the graph obtained from the graphs G 1 , … , G s and the edges connecting each vertex of G i with all the
D. Cardoso, Roberto C. Díaz, O. Rojo
semanticscholar +1 more source
, 2018 The \emph{distance matrix} of a simple connected graph $G$ is $D(G)=(d_{ij})$, where $d_{ij}$ is the distance between the $i$th and $j$th vertices of $G$. The \emph{distance signless Laplacian matrix} of the graph $G$ is $D_Q(G)=D(G)+Tr(G)$, where $Tr(G)$
Panigrahi, Pratima, Atik, Fouzul
core +1 more source
On the signless Laplacian and normalized signless Laplacian spreads of graphs
, 2022 Let G = (V, E), V = {v1, v2, …, vn}, be a simple connected graph with n vertices, m edges and a sequence of vertex degrees d1 ≽ d2 ≽ … ≽ dn. Denote by A and D the adjacency matrix and diagonal vertex degree matrix of G, respectively.
Igor Milovanović +8 more
core +1 more source
On the distance signless Laplacian spectral radius of graphs and digraphs
, 2017 Let \eta(G) denote the distance signless Laplacian spectral radius of a connected graph G. In this paper,bounds for the distance signless Laplacian spectral radius of connected graphs are given, and the extremal graph with the minimal distance signless ...
Li, Dan +5 more
core +1 more source
On the Adjacency, Laplacian, and Signless Laplacian Spectrum of Coalescence of Complete Graphs [PDF]
, 2016 Coalescence as one of the operations on a pair of graphs is significant due to its simple form of chromatic polynomial. The adjacency matrix, Laplacian matrix, and signless Laplacian matrix are common matrices usually considered for discussion under ...
S. R. Jog, Raju Kotambari
core +1 more source