Maximal canonical graphs with seven nonzero eigenvalues

Please use this identifier to cite or link to this item: https://scidar.kg.ac.rs/handle/123456789/9709

Full metadata record

DC Field	Value	Language
dc.rights.license	BY-NC-ND	-
dc.contributor.author	Lazić, Mirjana	-
dc.date.accessioned	2020-09-19T18:56:13Z	-
dc.date.available	2020-09-19T18:56:13Z	-
dc.date.issued	2010	-
dc.identifier.issn	0350-1302	-
dc.identifier.uri	https://scidar.kg.ac.rs/handle/123456789/9709	-
dc.description.abstract	In [3] and [4] A. Torgašev described all finite and infinite connected graphs having 3, 4 or 5 nonzero eigenvalues (not necessarily distinct). In the same papers he has given a general method how to describe all connected graphs with any fixed number of nonzero eigenvalues. In [2] M. Lepović applying his method described all finite connected graphs which have exactly 6 nonzero eigenvalues. We here describe all finite connected graphs with exactly 7 nonzero eigenvalues.	-
dc.rights	openAccess	-
dc.rights.uri	https://creativecommons.org/licenses/by-nc-nd/4.0/	-
dc.source	Publications de l'Institut Mathematique	-
dc.title	Maximal canonical graphs with seven nonzero eigenvalues	-
dc.type	article	-
dc.identifier.doi	10.2298/PIM1002077L	-
dc.identifier.scopus	2-s2.0-78649962044	-
Appears in Collections:	Faculty of Science, Kragujevac

121

7

Files in This Item:

File	Description	Size	Format
10.2298-PIM1002077L.pdf		116.43 kB	Adobe PDF	View/Open

This item is licensed under a Creative Commons License

SCIDAR - A Digital Archive of the University of Kragujevac