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/780
DC FieldValueLanguage
dc.contributor.authorStanić, Zoranen_US
dc.date.accessioned2022-08-15T15:00:17Z-
dc.date.available2022-08-15T15:00:17Z-
dc.date.issued2014-03-31-
dc.identifier.issn0166218Xen
dc.identifier.urihttps://research.matf.bg.ac.rs/handle/123456789/780-
dc.description.abstractConnected graphs whose eigenvalues are mutually distinct and main are called controllable graphs. In recent work their relevance in control theory is recognized, and a number of theoretical and computational results are obtained. In this paper, some criteria for non-controllability of graphs are considered, and certain constructions of controllable graphs are given. Controllable graphs whose index does not exceed a given constant (close to 2.0366) are limited as part of two specific families of trees, and controllable graphs with extremal diameter are discussed. Some computational results are presented, along with corresponding theoretical observations. © 2013 Elsevier B.V. All rights reserved.en_US
dc.language.isoenen_US
dc.publisherElsevieren_US
dc.relation.ispartofDiscrete Applied Mathematicsen_US
dc.subjectConstructions of graphsen_US
dc.subjectControllable graphsen_US
dc.subjectMain eigenvaluesen_US
dc.subjectSmall indexen_US
dc.titleFurther results on controllable graphsen_US
dc.typeArticleen_US
dc.identifier.doi10.1016/j.dam.2013.10.011-
dc.identifier.scopus2-s2.0-84893766028-
dc.identifier.isi000332434400022-
dc.identifier.urlhttps://api.elsevier.com/content/abstract/scopus_id/84893766028-
dc.contributor.affiliationNumerical Mathematics and Optimizationen_US
dc.relation.issn0166-218Xen_US
dc.description.rankM22en_US
dc.relation.firstpage215en_US
dc.relation.lastpage221en_US
dc.relation.volume166en_US
item.openairetypeArticle-
item.cerifentitytypePublications-
item.fulltextNo Fulltext-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.languageiso639-1en-
item.grantfulltextnone-
crisitem.author.deptNumerical Mathematics and Optimization-
crisitem.author.orcid0000-0002-4949-4203-
Appears in Collections:Research outputs
Show simple item record

SCOPUSTM   
Citations

10
checked on Mar 28, 2025

Page view(s)

8
checked on Jan 19, 2025

Google ScholarTM

Check

Altmetric

Altmetric


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