1. University of Kragujevac Digital Archive
  2. University of Kragujevac
  3. Faculty of Science, Kragujevac
Please use this identifier to cite or link to this item: https://scidar.kg.ac.rs/handle/123456789/9709
Full metadata record
DC FieldValueLanguage
dc.rights.licenseopenAccess-
dc.contributor.authorLazić, Mirjana-
dc.date.accessioned2020-09-19T18:56:13Z-
dc.date.available2020-09-19T18:56:13Z-
dc.date.issued2010-
dc.identifier.issn0350-1302-
dc.identifier.urihttps://scidar.kg.ac.rs/handle/123456789/9709-
dc.description.abstractIn [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.rightsinfo:eu-repo/semantics/openAccess-
dc.rights.urihttps://creativecommons.org/licenses/by-nc-nd/4.0/-
dc.sourcePublications de l'Institut Mathematique-
dc.titleMaximal canonical graphs with seven nonzero eigenvalues-
dc.typearticle-
dc.identifier.doi10.2298/PIM1002077L-
dc.identifier.scopus2-s2.0-78649962044-
Appears in Collections:Faculty of Science, Kragujevac

Page views(s)

442

Downloads(s)

11

Files in This Item:
File Description SizeFormat 
10.2298-PIM1002077L.pdf116.43 kBAdobe PDFThumbnail
View/Open
Show simple item record


This item is licensed under a Creative Commons License Creative Commons