Bipartite density of cubic graphs: The case of equality

DC Field	Value	Language
dc.contributor.author	Stevanović, Dragan	en
dc.date.accessioned	2020-05-01T20:13:05Z	-
dc.date.available	2020-05-01T20:13:05Z	-
dc.date.issued	2004-06-06	en
dc.identifier.issn	0012-365X	en
dc.identifier.uri	http://researchrepository.mi.sanu.ac.rs/handle/123456789/1303	-
dc.description.abstract	Recently, Berman and Zhang (Discrete Math. 260 (2003) 27) obtained an upper bound for the bipartite density of cubic graphs in terms of the smallest eigenvalue of an adjacency matrix and attempted to characterize graphs for which the upper bound is attained. Here we do characterize graphs for which the upper bound is attained, and correct a few errors from Berman and Zhang's paper.	en
dc.publisher	Elsevier	-
dc.relation	Serbian Ministry of Science, Technology and Development, Grant 1389	-
dc.relation.ispartof	Discrete Mathematics	en
dc.subject	Bipartite density of graph \| Cubic graph \| Eigenvalue \| Exceptional graph \| Generalized line graph \| Line graph	en
dc.title	Bipartite density of cubic graphs: The case of equality	en
dc.type	Article	en
dc.identifier.doi	10.1016/j.disc.2004.03.002	en
dc.identifier.scopus	2-s2.0-2442700665	en
dc.relation.firstpage	279	en
dc.relation.lastpage	281	en
dc.relation.issue	1-3	en
dc.relation.volume	283	en
dc.description.rank	M22	-
item.openairetype	Article	-
item.openairecristype	http://purl.org/coar/resource_type/c_18cf	-
item.cerifentitytype	Publications	-
item.grantfulltext	none	-
item.fulltext	No Fulltext	-
crisitem.author.orcid	0000-0003-2908-305X	-

1

checked on Apr 22, 2024

28

checked on Apr 23, 2024

Check