1. Research with MATF
  2. MATF
  3. Research outputs
Please use this identifier to cite or link to this item: https://research.matf.bg.ac.rs/handle/123456789/1747
DC FieldValueLanguage
dc.contributor.authorStanić, Zoranen_US
dc.date.accessioned2025-03-20T14:00:39Z-
dc.date.available2025-03-20T14:00:39Z-
dc.date.issued2010-
dc.identifier.urihttps://research.matf.bg.ac.rs/handle/123456789/1747-
dc.description.abstractA graph is called self-centered if all of its vertices have the same eccentricity. We prove some new properties of such graphs and obtain all minimal self-centered graphs of up to 10 vertices.en_US
dc.language.isoenen_US
dc.publisherTaylor and Francisen_US
dc.relation.ispartofAKCE International Journal of Graphs and Combinatoricsen_US
dc.subjecteccentricityen_US
dc.subjectradiusen_US
dc.subjectself-centered graphen_US
dc.subjectdiameteren_US
dc.titleSome notes on minimal self-centered graphsen_US
dc.typeArticleen_US
dc.identifier.isi000210197500010-
dc.identifier.urlhttps://www.tandfonline.com/doi/epdf/10.1080/09728600.2010.12088915?needAccess=true-
dc.contributor.affiliationNumerical Mathematics and Optimizationen_US
dc.relation.issn0972-8600en_US
dc.relation.firstpage97en_US
dc.relation.lastpage102en_US
dc.relation.volume7en_US
dc.relation.issue1en_US
item.openairetypeArticle-
item.fulltextNo Fulltext-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.grantfulltextnone-
item.languageiso639-1en-
item.cerifentitytypePublications-
crisitem.author.deptNumerical Mathematics and Optimization-
crisitem.author.orcid0000-0002-4949-4203-
Appears in Collections:Research outputs
Show simple item record

Google ScholarTM

Check


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