Published in
Elsevier, Discrete Mathematics, 1-3(236), p. 13-24, 2001
DOI: 10.1016/s0012-365x(00)00426-x
Links
Tools
The nonregular, bipartite, integral graphs with maximum degree 4. Part I: Basic properties
Journal article published in 2001 by
Krystyna T. Balinska,
Slobodan K. Simic
This paper is made freely available by the publisher.
Full text: Download
Published version:
archiving forbidden
Data provided by 
Abstract
A graph is integral if the spectrum (of its adjacency matrix) consists entirely of integers. In this paper, we begin the search of those integral graphs which are nonregular, bipartite and have maximum degree 4. Here, we investigate the structure of these graphs, and provide many properties which facilitate a computer search. Among others, we have shown that any graph in question has not more than 78 vertices.