نتایج جستجو برای: laplacian eigenvalues of graph
تعداد نتایج: 21177398 فیلتر نتایج به سال:
Product graphs have been gainfully used in literature to generate mathematical models of complex networks which inherit properties of real networks. Realizing the duplication phenomena imbibed in the definition of corona product of two graphs, we define corona graphs. Given a small simple connected graph which we call basic graph, corona graphs are defined by taking corona product of the basic ...
Contents Chapter 1. Eigenvalues and the Laplacian of a graph 1 1.1. Introduction 1 1.2. The Laplacian and eigenvalues 2 1.3. Basic facts about the spectrum of a graph 6
The question of what happens to the eigenvalues of the Laplacian of a graph when we delete a vertex is addressed. It is shown that λi − 1 ≤ λi ≤ λi+1, where λi is the ith smallest eigenvalues of the Laplacian of the original graph and λ v i is the ith smallest eigenvalues of the Laplacian of the graph G[V −v]; i.e., the graph obtained after removing the vertex v. It is shown that the average nu...
A signless Laplacian eigenvalue of a graph G is called a main signless Laplacian eigenvalue if it has an eigenvector the sum of whose entries is not equal to zero. In this paper, some necessary and sufficient conditions for a graph with one main signless Laplacian eigenvalue or two main signless Laplacian eigenvalues are given. And the trees and unicyclic graphs with exactly two main signless L...
The question of what happens to the eigenvalues of the Laplacian of a graph when we delete a vertex is addressed. It is shown that λi − 1 ≤ λi ≤ λi+1, where λi is the ith smallest eigenvalues of the Laplacian of the original graph and λ v i is the ith smallest eigenvalues of the Laplacian of the graph G[V −v]; i.e., the graph obtained after removing the vertex v. It is shown that the average nu...
The energy of a graph G is equal to the sum of absolute values of the eigenvalues of the adjacency matrix of G, whereas the Laplacian energy of a graph G is equal to the sum of the absolute value of the difference between the eigenvalues of the Laplacian matrix of G and average degree of the vertices of G. Motivated by the work from Sharafdini et al. [R. Sharafdini, H. Panahbar, Vertex weighted...
For a simple connected graph G with n-vertices having Laplacian eigenvalues μ1, μ2, . . . , μn−1, μn = 0, and signless Laplacian eigenvalues q1, q2, . . . , qn, the Laplacian-energy-like invariant(LEL) and the incidence energy (IE) of a graph G are respectively defined as LEL(G) = ∑n−1 i=1 √ μi and IE(G) = ∑n i=1 √ qi. In this paper, we obtain some sharp lower and upper bounds for the Laplacian...
Several inequalities on vertex degrees, eigenvalues, Laplacian eigen-values, and signless Laplacian eigenvalues of graphs are presented in this note. Some of them are generalizations of the inequalities in [2]. We consider only finite undirected graphs without loops or multiple edges. Notation and terminology not defined here follow that in [1]. We use [n] to denote the set of { 1, 2, ..., n}. ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید