Integral complete r-partite graphs

Share/Save/Bookmark

Wang, Ligong and Li, Xueliang and Hoede, Cornelis (2004) Integral complete r-partite graphs. Discrete Mathematics, 283 (1-3). pp. 231-241. ISSN 0012-365X

[img] PDF
Restricted to UT campus only
: Request a copy
246kB
Abstract:A graph is called integral if all the eigenvalues of its adjacency matrix are integers. In this paper, we give a useful sufficient and necessary condition for complete r-partite graphs to be integral, from which we can construct infinite many new classes of such integral graphs. It is proved that the problem of finding such integral graphs is equivalent to the problem of solving some Diophantine equations. The discovery of these integral complete r-partite graphs is a new contribution to the search of such integral graphs. Finally, we propose several basic open problems for further study.
Item Type:Article
Copyright:© 2004 Elsevier
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:http://purl.utwente.nl/publications/76197
Official URL:http://dx.doi.org/10.1016/j.disc.2004.02.011
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page