The nonregular, bipartite, integral graphs with maximum degree 4. Part I: Basic properties

DC Field	Value	Language
dc.contributor.author	Balińska, Krystyna	en
dc.contributor.author	Simić, Slobodan	en
dc.date.accessioned	2020-05-01T20:12:52Z	-
dc.date.available	2020-05-01T20:12:52Z	-
dc.date.issued	2001-06-06	en
dc.identifier.issn	0012-365X	en
dc.identifier.uri	http://researchrepository.mi.sanu.ac.rs/handle/123456789/1182	-
dc.description.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.	en
dc.publisher	Elsevier	-
dc.relation.ispartof	Discrete Mathematics	en
dc.subject	Graph spectrum \| Integral graphs \| Spectral moments	en
dc.title	The nonregular, bipartite, integral graphs with maximum degree 4. Part I: Basic properties	en
dc.type	Article	en
dc.identifier.doi	10.1016/S0012-365X(00)00426-X	en
dc.identifier.scopus	2-s2.0-0035815954	en
dc.relation.firstpage	13	en
dc.relation.lastpage	24	en
dc.relation.issue	1-3	en
dc.relation.volume	236	en
dc.description.rank	M22	-
item.fulltext	No Fulltext	-
item.openairetype	Article	-
item.grantfulltext	none	-
item.cerifentitytype	Publications	-
item.openairecristype	http://purl.org/coar/resource_type/c_18cf	-

22

checked on Apr 3, 2025

20

checked on Jan 31, 2025

Check