Results 51 to 60 of about 2,064,253 (190)
On the Normalized Laplacian Spectrum of Some Graphs
, 2020 In this paper we determine the normalized Laplacian spectrum of duplication vertex join of two graphs, duplication graph, splitting graph and double graph of a regular graph. Here we investigate some graph invariants like the normalized Laplacian energy,
Renny P. Varghese, D. Susha
semanticscholar +1 more source
On energy, Laplacian energy and $p$-fold graphs
Electronic Journal of Graph Theory and Applications, 2015 For a graph $G$ having adjacency spectrum ($A$-spectrum) $\lambda_n\leq\lambda_{n-1}\leq\cdots\leq\lambda_1$ and Laplacian spectrum ($L$-spectrum) $0=\mu_n\leq\mu_{n-1}\leq\cdots\leq\mu_1$, the energy is defined as $ E(G)=\sum_{i=1}^{n}|\lambda_i|$ and ...
Hilal A Ganie +2 more
doaj +1 more source
The sun graph is determined by its signless Laplacian spectrum
, 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
A spectral excess theorem for digraphs with normal Laplacian matrices [PDF]
Transactions on Combinatorics, 2018 The spectral excess theorem, due to Fiol and Garriga in 1997, is an important result, because it gives a good characterization of distance-regularity in graphs. Up to now, some authors have given some variations of this theorem.
Fateme Shafiei
doaj +1 more source
Strict Monotonicity and Unique Continuation for the Third-Order Spectrum of Biharmonic Operator
Abstract and Applied Analysis, 2012 We will study the spectrum for the biharmonic operator involving the laplacian and the gradient of the laplacian with weight, which we call third-order spectrum. We will show that the strict monotonicity of the eigenvalues of the operator , where , holds
Khalil Ben Haddouch +3 more
doaj +1 more source
Journal of Algorithms & Computational Technology, 2021 The normalized Laplacian spectrum of a graph is an important tool that one can use to find much information about its topological and structural characteristics and also on some relevant dynamical aspects, specifically in relation to random walks.
Zhiyong Zhu
doaj +1 more source
RECOGNITION OF HUMAN POSE FROM IMAGES BASED ON GRAPH SPECTRA [PDF]
The International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences, 2015 Recognition of human pose is an actual problem in computer vision. To increase the reliability of the recognition it is proposed to use structured information in the form of graphs.
A. A. Zakharov +2 more
doaj +1 more source
Outer Approximation of the Spectrum of a Fractal Laplacian
, 2009 We present a new method to approximate the Neumann spectrum of a Laplacian on a fractal K in the plane as a renormalized limit of the Neumann spectra of the standard Laplacian on a sequence of domains that approximate K from the outside.
Steven M. Heilman +2 more
core +1 more source
On the Seidel Laplacian spectrum of threshold graphs [PDF]
Journal of HyperstructuresA graph which does not contain C4, P4, or 2K2 as its induced subgraphs, is called a threshold graph. In this paper, we consider seidel laplacian matrix of a connected threshold graph and determine the seidel laplacian spectrum. Also, the characterization
Megha P M, Parvathy K S
doaj +1 more source
The Laplacian spectrum of a graph
, 1990 Let G be a graph. The Laplacian matrix L(G)=D(G) -A)(G) is the difference of the diagonal matrix of vertex degrees and the O-1 adjacency matrix. Various aspects of the spectrum of L (G) are investigated. Particular attention is given to multiplicities of
Merris, Russell +2 more
core +1 more source