### 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.

Original language | English |
---|---|

Pages (from-to) | 231-241 |

Journal | Discrete mathematics |

Volume | 283 |

Issue number | 1-3 |

DOIs | |

Publication status | Published - 2004 |

### Keywords

- Diophantine equation
- Integral graph
- Graph spectrum
- IR-76197
- Complete r-partite graph

## Fingerprint Dive into the research topics of 'Integral complete r-partite graphs'. Together they form a unique fingerprint.

## Cite this

Wang, L., Li, X., & Hoede, C. (2004). Integral complete r-partite graphs.

*Discrete mathematics*,*283*(1-3), 231-241. https://doi.org/10.1016/j.disc.2004.02.011