Results 101 to 110 of about 5,819 (125)
Some of the next articles are maybe not open access.
Laplacian and Signless Laplacian Spectrum of Commuting Graphs of Finite Groups
, 2018Summary: 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\).
J. Dutta, R. K. Nath
semanticscholar +3 more sources
The signless Laplacian spectrum of rooted product of graphs
Discrete Mathematics, Algorithms and Applications, 2018Let [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].
Maryam Maghsoudi, A. Heydari
semanticscholar +3 more sources
Two classes of graphs determined by the signless Laplacian spectrum
Linear Algebra and its ApplicationszbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jiachang Ye, Muhuo Liu, Zoran Stanić
semanticscholar +2 more sources
On Signless Laplacian Spectrum of Weakly Zero-Divisor Graph of Commutative Ring ℤ𝔫
Discrete Mathematics, Algorithms and ApplicationsLet [Formula: see text] be a commutative ring with identity [Formula: see text]. The graph known as the weakly zero-divisor graph of the commutative ring [Formula: see text], denoted as [Formula: see text], is a simple undirected graph whose set of vertices consists of the non-zero zero-divisors of [Formula: see text] and two distinct vertices [Formula:
N. Rehman, Nazim, S. Mir
semanticscholar +2 more sources
Signless Laplacian spectrum of a class of generalized corona and its application
Discrete Mathematics, Algorithms and Applications, 2018Let [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].
Pengli Lu, Ke Gao, Yumo Wu
semanticscholar +2 more sources
Discrete Mathematics, Algorithms and Applications, 2019
Let [Formula: see text] be a connected graph with a distance matrix [Formula: see text]. Let [Formula: see text] and [Formula: see text] be, respectively, the distance Laplacian matrix and the distance signless Laplacian matrix of graph [Formula: see ...
Deena C. Scaria, G. Indulal
semanticscholar +2 more sources
Let [Formula: see text] be a connected graph with a distance matrix [Formula: see text]. Let [Formula: see text] and [Formula: see text] be, respectively, the distance Laplacian matrix and the distance signless Laplacian matrix of graph [Formula: see ...
Deena C. Scaria, G. Indulal
semanticscholar +2 more sources
The European Physical Journal Plus, 2023
Ali Raza, Muhammad Mobeen Munir
semanticscholar +2 more sources
Ali Raza, Muhammad Mobeen Munir
semanticscholar +2 more sources
Further results on the distance signless Laplacian spectrum of graphs
Asian-European Journal of Mathematics, 2018The 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 +2 more
openaire +2 more sources
Linear and multilinear algebra
Let G be a multidigraph without self-loops. The complex Laplacian matrix of G, denoted by $ {L_{\mathbb {C}}}(G) $ LC(G), is defined in Barik et al. [On singularity and properties of eigenvectors of complex Laplacian matrix of multidigraphs.
S. Barik, Sane Umesh Reddy
semanticscholar +1 more source
Let G be a multidigraph without self-loops. The complex Laplacian matrix of G, denoted by $ {L_{\mathbb {C}}}(G) $ LC(G), is defined in Barik et al. [On singularity and properties of eigenvectors of complex Laplacian matrix of multidigraphs.
S. Barik, Sane Umesh Reddy
semanticscholar +1 more source
Comparison of Different Properties of Graph Using Adjacency Matrix and Signless Laplacian Matix
International Journal of Scientific Research in Science Engineering and TechnologyThis study highlights the advantages of using the Signless Laplacian spectrum over the traditional Adjacency matrix spectrum for graph representation.
Km. Priti Sahrawat, Dr. Ashish Kumar
semanticscholar +1 more source

