نتایج جستجو برای: distance signless laplacian matrix
تعداد نتایج: 601115 فیلتر نتایج به سال:
Let G be a simple connected graph with order n. $$\mathcal{L}(G)$$ and $$\mathcal{Q}(G)$$ the normalized Laplacian signless matrices of G, respectively. λk(G) k-th smallest eigenvalue G. Denote by ρ(A) spectral radius matrix A. In this paper, we study behaviors λ2(G) $$\rho(\mathcal{L}(G))$$ when is perturbed three operations. We also properties X for bipartite graphs, where unit eigenvector co...
A new distance measure between probability density functions (pdfs) is introduced, which we refer to as the Laplacian pdf distance. The Laplacian pdf distance exhibits a remarkable connection to Mercer kernel based learning theory via the Parzen window technique for density estimation. In a kernel feature space defined by the eigenspectrum of the Laplacian data matrix, this pdf distance is show...
In this paper, we show that the largest signless Laplacian H-eigenvalue of a connected k-uniform hypergraph G, where k ≥ 3, reaches its upper bound 2∆(G), where ∆(G) is the largest degree of G, if and only if G is regular. Thus the largest Laplacian H-eigenvalue of G, reaches the same upper bound, if and only if G is regular and oddbipartite. We show that an s-cycle G, as a k-uniform hypergraph...
We prove that the minimum value of the least eigenvalue of the signless Laplacian of a connected nonbipartite graph with a prescribed number of vertices is attained solely in the unicyclic graph obtained from a triangle by attaching a path at one of its endvertices. © 2008 Elsevier Inc. All rights reserved. AMS classification: 05C50
In this paper we observe that the minimal signless Laplacian spectral radius is obtained uniquely at the kite graph PKn−ω,ω among all connected graphs with n vertices and clique number ω. In addition, we show that the spectral radius μ of PKm,ω (m ≥ 1) satisfies
LetB(n, r) be the set of all bicyclic graphs with n vertices and r cut edges. In this paper we determine the unique graph with maximal adjacency spectral radius or signless Laplacian spectral radius among all graphs in B(n, r).
A spectral graph theory is a theory in which graphs are studied by means of eigenvalues of a matrix M which is in a prescribed way defined for any graph. This theory is called M -theory. We outline a spectral theory of graphs based on the signless Laplacians Q and compare it with other spectral theories, in particular with those based on the adjacency matrix A and the Laplacian L. The Q-theory ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید