Results 61 to 70 of about 1,315,432 (182)

Strict Monotonicity and Unique Continuation for the Third-Order Spectrum of Biharmonic Operator

open access: yesAbstract 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

Approximating graphs of a class of general Sierpinski triangles and their normalized Laplacian spectra

open access: yesJournal 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]

open access: yesThe 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

Gaps in the spectrum of the Laplacian on $3N$-Gaskets

open access: yesCommunications on Pure and Applied Analysis, 2015
This article develops analysis on fractal $3N$-gaskets, a class of post-critically finite fractals which include the Sierpinski triangle for $N=1$, specifically properties of the Laplacian $Δ$ on these gaskets. We first prove the existence of a self-similar geodesic metric on these gaskets, and prove heat kernel estimates for this Laplacian with ...
Kelleher, D.   +5 more
openaire   +4 more sources

On the Seidel Laplacian spectrum of threshold graphs [PDF]

open access: yesJournal of Hyperstructures
A 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

On the spectrum of Robin Laplacian in a planar waveguide [PDF]

open access: yesCzechoslovak Mathematical Journal, 2018
We consider the Laplace operator in a planar waveguide, i.e., an infinite two-dimensional straight strip of constant width, with particular types of Robin boundary conditions. We study the essential spectrum of the corresponding Laplacian when the boundary coupling function has a limit at infinity.
openaire   +2 more sources

Developments on Spectral Characterizations of Graphs [PDF]

open access: yes
In [E.R. van Dam and W.H. Haemers, Which graphs are determined by their spectrum?, Linear Algebra Appl. 373 (2003), 241-272] we gave a survey of answers to the question of which graphs are determined by the spectrum of some matrix associated to the graph.
Dam, E.R. van, Haemers, W.H.
core  

A novel method to construct cospectral graphs based on RT operation [PDF]

open access: yesAIP Advances
This paper presents a new graph operation, RT(G), which is formed by transforming each vertex and edge of the original graph G into a triangle. We analyze the relationship between the signless Laplacian characteristic polynomials of the graph RT(G) and ...
Xiu-Jian Wang   +2 more
doaj   +1 more source

Universal Adjacency Matrices with Two Eigenvalues [PDF]

open access: yes
AMS Mathematics Subject Classification: 05C50.Adjacency matrix;Universal adjacency matrix;Laplacian matrix;signless Laplacian;Graph spectra;Eigenvalues;Strongly regular ...
Omidi, G.R., Haemers, W.H.
core  

On the Laplacian spectrum of k-symmetric graphs

open access: yesDiscrete Mathematics
For some positive integer $k$, if the finite cyclic group $\mathbb{Z}_k$ can act freely on a graph $G$, then we say that $G$ is $k$-symmetric. In 1985, Faria showed that the multiplicity of Laplacian eigenvalue 1 is greater than or equal to the difference between the number of pendant vertices and the number of quasi-pendant vertices.
Sunyo Moon, Hyungkee Yoo
openaire   +3 more sources

Home - About - Disclaimer - Privacy