Results 151 to 160 of about 2,064,253 (190)
Some of the next articles are maybe not open access.
On the full Brouwer's Laplacian spectrum conjecture
Discrete Mathematics, 2022Ji-Ming Guo
exaly +2 more sources
Some results on the Laplacian spectrum
A graph is called a Laplacian integral graph if the spectrum of its Laplacian matrix consists of integers, and a graph G is said to be determined by its Laplacian spectrum if there does not exist other non-isomorphic graph H such that H and G share the ...
Muhuo Liu, Bolian Liu
exaly +2 more sources
The normalized Laplacian spectrum of quadrilateral graphs and its applications
Applied Mathematics and Computation, 2017Deqiong Li, Yaoping Hou
exaly +2 more sources
On the signless Laplacian and normalized Laplacian spectrum of the zero divisor graphs
Ricerche Di Matematica, 2020Mojgan Afkhami +2 more
exaly +2 more sources
Dataset complexity assessment based on cumulative maximum scaled area under Laplacian spectrum
Multimedia tools and applications, 2022Dataset complexity assessment aims to predict classification performance on a dataset with complexity calculation before training a classifier, which can also be used for classifier selection and dataset reduction.
Guang Li +3 more
semanticscholar +1 more source
On some forests determined by their Laplacian or signless Laplacian spectrum
We consider the class of graphs whose each component is either a proper subgraph of some Smith graphs, or belongs to a precized subset of Smith graphs.
Slobodan K SIMIĆ, Zoran Stanić
exaly +2 more sources
On distance signless Laplacian spectrum of graphs and spectrum of zero divisor graphs of ℤn
Linear and multilinear algebra, 2020For a simple connected graph G of order n, we obtain the distance signless Laplacian spectrum of the joined union of regular graphs in terms of their adjacency spectrum and the spectrum of an auxiliary matrix.
S. Pirzada +3 more
semanticscholar +1 more source
The Laplacian spectrum of a graph
Let G = (V, E) be a simple graph. Denote by D(G) the diagonal matrix of its vertexdegrees and by A(G) its adjacency matrix. Then, the Laplacian matrix of G is L(G) = D(G) − A(G).
Das, K.Ch.
exaly +2 more sources
Normalized Laplacian spectrum of complete multipartite graphs
Discrete Applied Mathematics, 2020The spectrum of the normalized Laplacian matrix of a graph provides many structural information of the graph, and it has many applications in numerous areas and in different guises. Let G be a complete k -partite graph with k ≥ 3 . In this paper, we give
Shaowei Sun, K. Das
semanticscholar +1 more source
On distance Laplacian spectrum (energy) of graphs
Discret. Math. Algorithms Appl., 2020For a simple connected graph G of order n having distance Laplacian eigenvalues ρ1L ≥ ρ 2L ≥⋯ ≥ ρ nL, the distance Laplacian energy DLE(G) is defined as DLE(G) =∑i=1n|ρ iL −2W(G) n |, where W(G) is...
Hilal A. Ganie
semanticscholar +1 more source

