نتایج جستجو برای: distance signless laplacian matrix
تعداد نتایج: 601115 فیلتر نتایج به سال:
a concept related to the spectrum of a graph is that of energy. the energy e(g) of a graph g is equal to the sum of the absolute values of the eigenvalues of the adjacency matrix of g . the laplacian energy of a graph g is equal to the sum of distances of the laplacian eigenvalues of g and the average degree d(g) of g. in this paper we introduce the concept of laplacian energy of fuzzy graphs. ...
Let G be a connected graph and Q(G) the signless Laplacian of G. The principal ratio γ(G) is maximum minimum entries Perron vector Q(G). In this paper, we consider among all graphs order n, show that for sufficiently large n extremal kite obtained by identifying an end vertex path to any complete graph.
If A is a real symmetric matrix and P is an orthogonal projection onto a hyperplane, then we derive a formula for the Moore-Penrose inverse of PAP . As an application, we obtain a formula for the MoorePenrose inverse of a Euclidean distance matrix (EDM) which generalizes formulae for the inverse of a EDM in the literature. To an invertible spherical EDM, we associate a Laplacian matrix (which w...
For any simple connected undirected graph, it is well known that the Kirchhoff and multiplicative degree-Kirchhoff indices can be computed using the Laplacian matrix. We show that the same is true for the additive degree-Kirchhoff index and give a compact Matlab program that computes all three Kirchhoffian indices with the Laplacian matrix as the only input.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید