Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

35

APPML
2006

favoriteEmaildiscussreport

80views more APPML 2006»

Unicyclic graphs with exactly two main eigenvalues

13 years 11 months ago

Unicyclic graphs with exactly two main eigenvalues

Download madis1.iss.ac.cn

An eigenvalue of a graph G is called a main eigenvalue if it has an eigenvector the sum of whose entries is not equal to zero, and it is well known that a graph has exactly one main eigenvalue if and only if it is regular. In this work, all connected unicyclic graphs with exactly two main eigenvalues are determined. c 2006 Elsevier Ltd. All rights reserved.

Yaoping Hou, Feng Tian

Real-time Traffic

APPML 2006 | Eigenvalues | Eigenvector | Main Eigenvalues |

claim paper

Related Content

» The spread of the unicyclic graphs

» Nonsingular mixed graphs with few eigenvalues greater than two

» Revisiting Two Classical Results on Graph Spectra

» QuasiSpectral Characterization of Strongly DistanceRegular Graphs

» Counting connected graphs asymptotically

» Motion planning in quantum control via intersection of eigenvalues

» Fast and Exact Topk Search for Random Walk with Restart

» Towards Topology Aware Networks

» Laplacian Spectrum of Weakly Quasithreshold Graphs

Post Info
More Details (n/a)

Added	10 Dec 2010
Updated	10 Dec 2010
Type	Journal
Year	2006
Where	APPML
Authors	Yaoping Hou, Feng Tian

Comments (0)