scientific article; zbMATH DE number 3991533

From MaRDI portal
Publication:3754022





[For the entire collection see Zbl 0608.00005.] An integral graph is a graph whose adjacency matrix has integral spectrum. The general problem of finding (or describing) all integral graphs, posed by F. Harary and A. Schwenk, seems to be intractable and only partial results were obtained so far (all integral graphs with maximum vertex degree three are known - see \textit{D. Cvetković, I. Gutman} and \textit{N. Trinajstić}, Conjugated molecules having integral graph spectra, Chem. Phys. Letters 29, 65-68 (1974), \textit{D. Cvetković}, Publ. Elektroteh. Fak., Univ. Beogr., Ser. Mat. Fiz. 498- 541, 107-113 (1975; Zbl 0315.05125), \textit{F. C. Bussemaker} and \textit{D. Cvetković}, ibid. 544-576, 43-48 (1977; Zbl 0357.05064), and \textit{A. J. Schwenk}, Theor. Appl. Graphs, Proc. Kalamazoo 1976, Lect. Notes Math. 642, 516-533 (1978; Zbl 0376.05050)). In this report we announce our result of finding all nonregular, nonbipartite integral graphs with maximum vertex degree four. The proof will appear in another paper of the authors [The nonregular, nonbipartite, integral graphs with maximum degree four, J. Comb., Inf. Syst. Sci. (to appear)]. Since the spectrum of a graph is the union of the spectra of its components, we restrict ourselves to connected graphs. (This paper is a shortened report.)











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3754022)