DC FieldValueLanguage
dc.contributor.authorVukićević Kovijanić, Žanaen
dc.contributor.authorStevanović, Draganen
dc.date.accessioned2020-05-01T20:13:00Z-
dc.date.available2020-05-01T20:13:00Z-
dc.date.issued2013-02-01en
dc.identifier.issn0166-218Xen
dc.identifier.urihttp://researchrepository.mi.sanu.ac.rs/handle/123456789/1256-
dc.description.abstractWe give sharp lower and upper bounds on the PI index of connected bicyclic graphs with constant number of vertices and characterize the case of equality for both bounds.en
dc.publisherElsevier-
dc.relationGraph theory and mathematical programming with applications in chemistry and computer science-
dc.relationSlovenian Agency for Research, projects P1-0285 and J1-4021-
dc.relation.ispartofDiscrete Applied Mathematicsen
dc.subjectBicyclic graphs | Padmakar-Ivan indexen
dc.titleBicyclic graphs with extremal values of PI indexen
dc.typeArticleen
dc.identifier.doi10.1016/j.dam.2012.09.015en
dc.identifier.scopus2-s2.0-84870410836en
dc.relation.firstpage395en
dc.relation.lastpage403en
dc.relation.issue3en
dc.relation.volume161en
dc.description.rankM22-
item.fulltextNo Fulltext-
item.openairetypeArticle-
item.grantfulltextnone-
item.cerifentitytypePublications-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
crisitem.author.orcid0000-0003-2908-305X-
crisitem.project.projectURLhttp://www.mi.sanu.ac.rs/novi_sajt/research/projects/174033e.php-
crisitem.project.fundingProgramDirectorate for Computer & Information Science & Engineering-
crisitem.project.openAireinfo:eu-repo/grantAgreement/NSF/Directorate for Computer & Information Science & Engineering/1740333-
Show simple item record

SCOPUSTM   
Citations

16
checked on Apr 2, 2025

Page view(s)

16
checked on Jan 31, 2025

Google ScholarTM

Check

Altmetric

Altmetric


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