Results 101 to 110 of about 858 (123)

On distance signless Laplacian spectrum of the complements of unicyclic graphs and trees

Linear Algebra and its Applications, 2021
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yuanjing Li, Rui Qin, Dan Li
openaire   +2 more sources

The signless Laplacian spectrum of rooted product of graphs

Discrete Mathematics, Algorithms and Applications, 2018
Let [Formula: see text] be a simple graph with [Formula: see text] vertices and [Formula: see text] be a sequence of [Formula: see text] rooted graphs [Formula: see text]. The rooted product [Formula: see text], of [Formula: see text] by [Formula: see text] is constructed by identifying the root vertex of [Formula: see text] with the [Formula: see ...
Maghsoudi, Maryam, Heydari, Abbas
openaire   +2 more sources

Laplacian and signless Laplacian spectrum of commuting graphs of finite groups

2018
Summary: The commuting graph of a finite non-abelian group \(G\) with center \(Z(G)\), denoted by \(\Gamma_G\), is a simple undirected graph whose vertex set is \(G\setminus Z(G)\), and two distinct vertices \(x\) and \(y\) are adjacent if and only if \(xy = yx\).
Dutta, Jutirekha, Nath, Rajat
openaire   +2 more sources

Signless Laplacian spectrum of a graph

Linear Algebra and its Applications
This article presents a significant contribution to the field of algebraic graph theory with a particular focus on the signless Laplacian spectrum of graphs. The authors successfully establish tight upper bounds for all signless Laplacian eigenvalues of a graph characterized by a prescribed order and minimum degree, notably surpassing previously known ...
Amir Hossein Ghodrati, Mohammad Ali Hosseinzadeh   +1 more
openaire   +1 more source

Signless Laplacian spectrum of the cozero-divisor graph of the commutative ring ℤ _𝑛

Georgian Mathematical Journal, 2023
Abstract Let 𝑅 be a commutative ring with identity 1 ≠ 0
Mohd Rashid, Muzibur Rahman Mozumder, Mohd Anwar   +2 more
openaire   +1 more source

Further results on the distance signless Laplacian spectrum of graphs

Asian-European Journal of Mathematics, 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 whose main entries are the vertex transmissions of [Formula: see text], and the spectral radius of ...
Alhevaz, Abdollah, Baghipur, Maryam, Hashemi, Ebrahim   +2 more
openaire   +2 more sources

On distance signless Laplacian spectrum of graphs and spectrum of zero divisor graphs of ℤ_n

Linear and Multilinear Algebra, 2020
For a simple connected graph G of order n, we obtain the distance signless Laplacian spectrum of the joined union of regular graphs G 1 , G 2 , … , G n in terms of their adjacency spectrum and the ...
S. Pirzada, Bilal A. Rather, M. Aijaz, T. A. Chishti   +3 more
openaire   +1 more source

Signless Laplacian spectrum of a class of generalized corona and its application

Discrete Mathematics, Algorithms and Applications, 2018
Let [Formula: see text] be a graph with [Formula: see text] edges, [Formula: see text] the subdivision graph of [Formula: see text] with [Formula: see text] the set of inserted vertices of [Formula: see text]. The generalized subdivision-edge corona graph [Formula: see text] of [Formula: see text] and [Formula: see text] is the graph obtained from ...
Pengli Lu, Ke Gao, Yumo Wu
openaire   +1 more source

Two classes of graphs determined by the signless Laplacian spectrum

Linear Algebra and its Applications
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jiachang Ye, Muhuo Liu, Zoran Stanić
openaire   +1 more source

Which multicone graphs are determined by their signless Laplacian spectrum? (The proof of a conjecture)

Journal of Discrete Mathematical Sciences and Cryptography, 2019
A multicone graph is defined to be the join of a clique and a regular graph. Let Km and denote a complete graph on m vertices and the complement of a complete graph on n vertices, respectively.
Ali Zeydi Abdian, Sara Pouyandeh, Bahman Askari   +2 more
openaire   +1 more source