Please use this identifier to cite or link to this item: https://scidar.kg.ac.rs/handle/123456789/17317
Full metadata record
DC FieldValueLanguage
dc.contributor.authorGutman, Ivan-
dc.contributor.authorFurtula, Boris-
dc.contributor.authorHua, Hongbo-
dc.date.accessioned2023-03-16T10:00:22Z-
dc.date.available2023-03-16T10:00:22Z-
dc.date.issued2007-
dc.identifier.issn0340-6253en_US
dc.identifier.urihttps://scidar.kg.ac.rs/handle/123456789/17317-
dc.description.abstractBased on the results of the preceding paper [H. Hua, MATCH Commun. Math. Comput. Chem. 58 (2007) 57–73], by means of an appropriate computer search, the bipartite unicyclic n-vertex graphs with greatest, second–greatest, and third–greatest energy are determined for all values of n .en_US
dc.language.isoen_USen_US
dc.publisherUniversity of Kragujevac, Faculty of Scienceen_US
dc.rightsinfo:eu-repo/semantics/openAccess-
dc.sourceMATCH Communications in Mathematical and in Computer Chemistry-
dc.titleBipartite unicyclic graphs with maximal, second-maximal, and third-maximal energyen_US
dc.typearticleen_US
dc.description.versionPublisheden_US
dc.type.versionPublishedVersionen_US
Appears in Collections:Faculty of Science, Kragujevac

Page views(s)

351

Downloads(s)

27

Files in This Item:
File Description SizeFormat 
paper0048.pdf208.39 kBAdobe PDFThumbnail
View/Open


Items in SCIDAR are protected by copyright, with all rights reserved, unless otherwise indicated.