V. Nikiforov, Bounds on graph eigenvalues I, Linear Algebra Appl. 420 (2007) 667-671.V. Nikiforov, Bounds on graph eigenvalues I, Linear Algebra Appl., 420(2007), 667-671.Vladimir Nikiforov. Bounds on graph eigenvalues i. Linear Algebra and its Appli- cations, 420(2):667-671, 2007...
09 Graphon spectral decompositions for LQG control and games 47:55 Mitigating Epidemics_ Perspectives from Stackelberg Mean Field Games and Graphon 53:32 On nonlocal interactions in mean field games - Part 1 38:23 On nonlocal interactions in mean field games - Part 2 11:39 Z_2 harmonic ...
Let G be a simple graph with n vertices.We denote by λ_i(G) the i-th largest eigenvalue of G.In this paper,several results are presented concerning bounds on the eigenvalues of G.In particular,it is shown that -1≤λ_2(G)≤(n-2)/2,and the left hand equality holds if and onl...
ODD numbersEIGENVALUESFor any simple graph G, the signless Laplacian matrix of G is defined as D(G)+A(G), where D(G) and A(G) are the ... MR Oboudi - 《Transactions on Combinatorics》 被引量: 0发表: 2022年 Sums of squares of eigenvalues and the vector chromatic number In this ...
Stanić, Z.: Inequalities for Graph Eigenvalues, London Mathematical Society Lecture Note Series, vol. 423. Cambridge University Press, Cambridge (2015) Book Google Scholar Stevanović, D.: Spectral Radius of Graphs. Academic Press, New York (2015) MATH Google Scholar Tian, G.-X., Chen...
The energy (G) of a graph is the sum of absolute values of the eigenvalues of its adjacency matrix. The matching number \mu(G) is the number of edges in a maximum matching. For a connected graph of order with largest vertex degree Δ≥ 6 we present two new upper bounds for the ener...
Bounds on the greatest eigenvalue of graphs The eigenvalues of a graph are the eigenvalues of its adjacency matrix. This paper presents some upper bounds on the greatest eigenvalue of graphs and lowe... KC Das,P Kumar - 《Indian Journal of Pure & Applied Mathematics》 被引量: 29发表: 200...
where is the set of indices corresponding to the eigenvalues of M̃ that are closer to than to . 5 Sect. 4 demonstrates an application to the perturbation of a null-space of a matrix in the context of a graph perturbation problem. 2 Preliminaries 2.1 A metric on Definition 2 (Subspa...
- 《Selected Areas in Communications IEEE Journal on》 被引量: 149发表: 2006年 Upper Bounds for the Laplacian Graph Eigenvalues We first apply non-negative matrix theory to the matrix K=D+A,where D and A arethe degree-diagonal and adjacency matrices of a graph G,respectively,to esta... ...
摘要: Let G be a simple connected graph with n vertices and m edges, and let q1 q2 qn be its signless Laplacian eigenvalues. The incident energy of G is dened as IE(G) = 危n i=1 p qi. Some new bounds for IE(G) are obtained....