نتایج جستجو برای: laplacian eigenvalues of graph
تعداد نتایج: 21177398 فیلتر نتایج به سال:
In this class, we introduced the random walk on graphs. The last lecture shows Perron-Frobenius theory to the analysis of primary eigenvectors which is the stationary distribution. In this lecture we will study the second eigenvector. To analyze the properties of the graph, we construct two matrices: one is (unnormalized) graph Laplacian and the other is normalized graph Laplacian. In the first...
Let G be a graph with n vertices and m edges. Let λ1, λ2, . . . , λn be the eigenvalues of the adjacency matrix of G, and let μ1, μ2, . . . , μn be the eigenvalues of the Laplacian matrix of G. An earlier much studied quantity E(G) = ∑ni=1 |λi | is the energy of the graph G. We now define and investigate the Laplacian energy as LE(G) = ∑ni=1 |μi − 2m/n|. There is a great deal of analogy between...
the degree kirchhoff index of a connected graph $g$ is defined as the sum of the terms $d_i,d_j,r_{ij}$ over all pairs of vertices, where $d_i$ is the degree of the $i$-th vertex, and $r_{ij}$ the resistance distance between the $i$-th and $j$-th vertex of $g$. bounds for the degree kirchhoff index of the line and para-line graphs are determined. the special case of regular grap...
Let G be a simple graph with order n and size m. The quantity $$M_1(G)=\sum _{i=1}^{n}d^2_{v_i}$$ is called the first Zagreb index of G, where $$d_{v_i}$$ degree vertex $$v_i$$ , for all $$i=1,2,\dots ,n$$ . signless Laplacian matrix $$Q(G)=D(G)+A(G)$$ A(G) D(G) denote, respectively, adjacency diagonal degrees G. $$q_1\ge q_2\ge \dots \ge q_n\ge 0$$ eigenvalues largest eigenvalue $$q_1$$ spectr...
Let G^s be a signed graph, where G = (V;E) is the underlying simple graph and s : E(G) to {+, -} is the sign function on E(G). In this paper, we obtain k-th signed spectral moment and k-th signed Laplacian spectral moment of Gs together with coefficients of their signed characteristic polynomial and signed Laplacian characteristic polynomial are calculated.
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...
We consider the normalized Laplacian matrix for signed graphs and derive interlacing results for its spectrum. In particular, we investigate the effects of several basic graph operations, such as edge removal and addition and vertex contraction, on the Laplacian eigenvalues. We also study vertex replication, whereby a vertex in the graph is duplicated together with its neighboring relations. Th...
This paper presents a new method for estimating the eigenvalues of the Laplacian matrix associated with the graph describing the network topology of a multi-agent system. Given an approximate value of the average of the initial condition of the network state and some intermediate values of the network state when performing a Laplacian-based average consensus, the estimation of the Laplacian eig...
We study the spectral properties of the Laplacian matrices and the normalized Laplacian matrices of the Erdös-Rényi random graph G(n, pn) for large n. Although the graph is simple, we discover some interesting behaviors of the two Laplacian matrices. In fact, under the dilute case, that is, pn ∈ (0, 1) and npn → ∞, we prove that the empirical distribution of the eigenvalues of the Laplacian mat...
This paper develops the necessary tools to understand the relationship between eigenvalues of the Laplacian matrix of a graph and the connectedness of the graph. First we prove that a graph has k connected components if and only if the algebraic multiplicity of eigenvalue 0 for the graph’s Laplacian matrix is k. We then prove Cheeger’s inequality (for dregular graphs) which bounds the number of...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید