Spectral characterization of graphs whose second largest eigenvalue is less than 1

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Spectral Characterization of Graphs with Small Second Largest Laplacian Eigenvalue

The family G of connected graphs with second largest Laplacian eigenvalue at most θ, where θ = 3.2470 is the largest root of the equation μ−5μ+6μ−1 = 0, is characterized by Wu, Yu and Shu [Y.R. Wu, G.L. Yu and J.L. Shu, Graphs with small second largest Laplacian eigenvalue, European J. Combin. 36 (2014) 190–197]. Let G(a, b, c, d) be a graph with order n = 2a + b + 2c + 3d + 1 that consists of ...

متن کامل

Graphs with three distinct eigenvalues and largest eigenvalue less than

Article history: Received 13 June 2008 Accepted 13 November 2008 Available online xxxx Submitted by R.A. Brualdi AMS classification: 05C50

متن کامل

On unicyclic graphs whose second largest eigenvalue dose not exceed 1

Connected graphs in which the number of edges equals the number of vertices are called unicyclic graphs. In this paper, all unicyclic graphs whose second largest eigenvalue does not exceed 1 have been determined. ? 2003 Elsevier B.V. All rights reserved.

متن کامل

Graphs with small second largest Laplacian eigenvalue

Let L(G) be the Laplacian matrix of G. In this paper, we characterize all of the connected graphs with second largest Laplacian eigenvalue no more than l; where l . = 3.2470 is the largest root of the equation μ3 − 5μ2 + 6μ − 1 = 0. Moreover, this result is used to characterize all connected graphs with second largest Laplacian eigenvalue no more than three. © 2013 Elsevier Ltd. All rights rese...

متن کامل

Graphs with fourth Laplacian eigenvalue less than two

In this paper, all connected graphs with the fourth largest Laplacian eigenvalue less than two are determined, which are used to characterize all connected graphs with exactly three Laplacian eigenvalues no less than two. Moreover, we determine bipartite graphs such that the adjacency matrices of their line graphs have exactly three nonnegative eigenvalues. © 2003 Elsevier Ltd. All rights reser...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Linear Algebra and its Applications

سال: 2011

ISSN: 0024-3795

DOI: 10.1016/j.laa.2010.06.011