نتایج جستجو برای: seidel laplacian eigenvalues

تعداد نتایج: 31896  

Journal: :Automatica 2013
Mauro Franceschelli Andrea Gasparri Alessandro Giua Carla Seatzu

In this paper we present a decentralized algorithm to estimate the eigenvalues of the Laplacian matrix that encodes the network topology of a multi-agent system. We consider network topologies modeled by undirected graphs. The basic idea is to provide a local interaction rule among agents so that their state trajectory is a linear combination of sinusoids oscillating only at frequencies functio...

Journal: :Symmetry 2015
Yilun Shang

Let G be a simple graph of order n with eigenvalues λ1, λ2, · · · , λn and normalized Laplacian eigenvalues μ1,μ2, · · · ,μn. The Estrada index and normalized Laplacian Estrada index are defined as EE(G) = ∑n k=1 e λk and LEE(G) = ∑n k=1 e μk−1, respectively. We establish upper and lower bounds to EE and LEE for edge-independent random graphs, containing the classical Erdös-Rényi graphs as spec...

In this study, inverse nodal problem is solved for the p-Laplacian operator with two potential functions. We present some asymptotic formulas which have been proved in [17,18] for the eigenvalues, nodal points and nodal lengths, provided that a potential function is unknown. Then, using the nodal points we reconstruct the potential function and its derivatives. We also introduce a solution of i...

2007
Naoki Saito Zhihua Zhang Allen Xue

In this section, we will introduce the work of Kbabou, Hermi, and Rhonma (2007)[2]. Their main idea is to use the eigenvalues and their ratios of the Dirichlet-Laplacian for various planar shapes as their features for classifying them. Let the sequence 0 < λ 1 < λ 2 ≤ λ 3 ≤ · · · ≤ λ k ≤ · · · → ∞ be the sequence of eigenvalues of Dirichlet-Laplacian problem: −∆u = λu in a given bounded planar ...

Journal: :SIAM J. Matrix Analysis Applications 2000
Stephen Guattery Gary L. Miller

Graph embeddings are useful in bounding the smallest nontrivial eigenvalues of Laplacian matrices from below. For an n×n Laplacian, these embedding methods can be characterized as follows: The lower bound is based on a clique embedding into the underlying graph of the Laplacian. An embedding can be represented by a matrix Γ; the best possible bound based on this embedding is n/λmax(Γ Γ). Howeve...

2008
Alexander GETMANENKO

The Witten Laplacian corresponding to a Morse function on the circle is studied using methods of complex WKB and resurgent analysis. It is shown that under certain assumptions the low-lying eigenvalues of the Witten Laplacian are resurgent.

2011
A. Mohammadian B. Tayfeh-Rezaie

In this paper, we investigate connected nonregular graphs with four distinct Laplacian eigenvalues. We characterize all such graphs which are bipartite or have exactly one multiple Laplacian eigenvalue. Other examples of interest are also presented.

2010
Steve Butler

A graph can be associated with a matrix in several ways. For instance, by associating the vertices of the graph to the rows/columns and then using 1 to indicate an edge and 0 otherwise we get the adjacency matrix A. The combinatorial Laplacian matrix is defined by L = D − A where D is a diagonal matrix with diagonal entries the degrees and A is again the adjacency matrix. Both of these matrices...

Journal: :Linear Algebra and its Applications 2015

2012
A. DILEK MADEN ŞERIFE BÜYÜKKÖSE

Let G be a connected simple graph whose Laplacian eigenvalues are 0 = μn (G) μn−1 (G) · · · μ1 (G) . In this paper, we establish some upper and lower bounds for the algebraic connectivity and the largest Laplacian eigenvalue of G . Mathematics subject classification (2010): 05C50, 15A18.

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید