Results 51 to 60 of about 42,138 (164)
On distance signless Laplacian spectrum and energy of graphs
Electronic Journal of Graph Theory and Applications, 2018 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
Eigenvalue Bounds for the Signless $p$-Laplacian
The Electronic Journal of Combinatorics, 2018 We consider the signless $p$-Laplacian $Q_p$ of a graph, a generalisation of the quadratic form of the signless Laplacian matrix (the case $p=2$). In analogy to Rayleigh's principle the minimum and maximum of $Q_p$ on the $p$-norm unit sphere are called its smallest and largest eigenvalues, respectively.
Elizandro Max Borba, Uwe Schwerdtfeger
openaire +4 more sources
On the main signless Laplacian eigenvalues of a graph [PDF]
The Electronic Journal of Linear Algebra, 2013 A signless Laplacian eigenvalue of a graph $G$ is called a main signless Laplacian eigenvalue if it has an eigenvector the sum of whose entries is not equal to zero. In this paper, we first give the necessary and sufficient conditions for a graph with one main signless Laplacian eigenvalue or two main signless Laplacian eigenvalues, and then ...
Deng, Hanyuan, Huang, He
openaire +2 more sources
Communications in Advanced Mathematical Sciences, 2018 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
Spectra of closeness Laplacian and closeness signless Laplacian of graphs
RAIRO - Operations Research, 2022 For a graph G with vertex set V(G) and u, v ∈ V(G), the distance between vertices u and v in G, denoted by dG(u,v), is the length of a shortest path connecting them and it is ∞ if there is no such a path, and the closeness of vertex u in G is cG(u) = ∑w∈V(G)2-dG(u,w).
Lu Zheng, Bo Zhou 0007
openaire +1 more source
On the distance signless Laplacian spectral radius of graphs and digraphs [PDF]
, 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
The maximum clique and the signless Laplacian eigenvalues [PDF]
, 1994 summary:Lower and upper bounds are obtained for the clique number $\omega (G)$ and the independence number $\alpha (G)$, in terms of the eigenvalues of the signless Laplacian matrix of a graph $G$
Liu, BoLian +3 more
core +1 more source
The sun graph is determined by its signless Laplacian spectrum [PDF]
, 2010 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
Spectral properties of the commuting graphs of certain groups
AKCE International Journal of Graphs and Combinatorics, 2019 Let G be a finite group. The commuting graph Γ=C(G)is a simple graph with vertex set G and two vertices are adjacent if and only if they commute with each other.
M. Torktaz, A.R. Ashrafi
doaj +1 more source
Linear Algebra and its Applications, 2010 The signless Laplacian spread of \(G\) is defined as \(SQ(G) = \mu_1 (G) - \mu_n (G)\), where \(\mu_1 (G)\) and \(\mu_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)\). Moreover, the unique unicyclic graph with maximum signless Laplacian
Liu, Muhuo, Liu, Bolian
openaire +2 more sources