Spectral Characterization of Generalized Cocktail-Party Graphs
Received:May 31, 2011  Revised:October 30, 2011
Key Words: adjacency matrix   spectral characterization   generalized line graph   generalized cocktail-party graphs.  
Fund Project:Supported by the National Natural Science Foundation of China (Grant No.10961023), National Natural Science Foundation of China for Young Scholars (Grant No.11101232), Natural Science Foundation of Qinghai Province for Young Scholars (Grant No.2011-Z-929Q) and Scientific Research Innovation Program of Qinghai Normal University.
Author NameAffiliation
Jianfeng WANG Department of Mathematics, Qinghai Normal University, Qinghai 810008, P. R. China 
Qiongxiang HUANG College of Mathematics and System Science, Xinjiang University, Xinjiang 830046, P. R. China 
Hits: 2959
Download times: 4186
Abstract:
      In the paper, we prove that all generalized cocktail-party graphs with order at least 23 are determined by their adjacency spectra.
Citation:
DOI:10.3770/j.issn:2095-2651.2012.06.005
View Full Text  View/Add Comment  
  Copyright © Journal of Mathematical Research with Applications
Sponsored by：Dalian University of Technology, China Society for Industrial and Applied Mathematics
Address：No.2 Linggong Road, Ganjingzi District, Dalian City, Liaoning Province, P. R. China , Postal code ：116024
Service Tel：86-411-84707392 Email：jmre@dlut.edu.cn
Designed by Beijing E-tiller Co.,Ltd.
Due to security factors, early browsers cannot log in. It is recommended to log in with IE10, IE11, Google, Firefox, and 360 new browsers.