Paper Information

Title: 

ON GRAPHS WHOSE SECOND LARGEST EIGENVALUE EQUALS 1

Type: SPEECH
Author(s): ASGHAR SHARGHI L.*,KIANI D.
 
 *FACULTY OF MATHEMATICS AND COMPUTER SCIENCES, AMIRKABIR UNIVERSITY OF TECHNOLOGY TEHRAN, IRAN
 
Name of Seminar: SEMINAR ON ALGEBRA (SALG20)
Type of Seminar:  CONFERENCE
Sponsor:  TARBIAT MOALLEM UNIVERSITY, FACULTY OF MATHEMATICAL SCIENCES AND COMPUTER
Date:  2009Volume 20
 
 
Abstract: 

Let G be a graph of order n and let μ be an eigenvalue of multiplic- ity m. A star complement for μ in G is an induced subgraph of G of order n-m with no eigenvalue μ. Here we first identify among Cactus graphs, complete three partite graphs Kn,n,n, and bicyclic graphs which can be star complement for 1 as the second largest eigenvalue. Using the graphs obtained, we next search for their maximal extensions, either by theoretical means, or by computer aided search.

 
Keyword(s): STAR COMPLEMENT, ADJACENCY MATRIX, GRAPH EIGENVALUES
 
Yearly Visit 4   pdf-file tarjomyar
 
Latest on Blog
Enter SID Blog