DC FieldValueLanguage
dc.contributor.authorBelardo, Francescoen
dc.contributor.authorLi Marzi, Enzoen
dc.contributor.authorSimić, Slobodanen
dc.date.accessioned2020-05-01T20:12:46Z-
dc.date.available2020-05-01T20:12:46Z-
dc.date.issued2016-07-10en
dc.identifier.issn0166-218Xen
dc.identifier.urihttp://researchrepository.mi.sanu.ac.rs/handle/123456789/1119-
dc.description.abstractWe use star complement technique to construct a basis for -2 of signed line graphs using their root signed graphs. In other words, we offer a generalization of the corresponding results known in the literature for (unsigned) graphs in the context of line graphs and generalized line graphs.en
dc.publisherElsevier-
dc.relationUniversity of Primorska, the operation n. 3330-14-500033-
dc.relationGraph theory and mathematical programming with applications in chemistry and computer science-
dc.relationPRIN 2012 (2012XZE22K) “Strutture Geometriche, Combinatoria e loro Applicazioni”-
dc.relation.ispartofDiscrete Applied Mathematicsen
dc.subjectEigenspaces | Eigenvector | Line graph | Signed graph | Star complementen
dc.titleSigned line graphs with least eigenvalue -2: The star complement techniqueen
dc.typeArticleen
dc.identifier.doi10.1016/j.dam.2016.02.018en
dc.identifier.scopus2-s2.0-84977939771en
dc.relation.firstpage29en
dc.relation.lastpage38en
dc.relation.volume207en
dc.description.rankM22-
item.cerifentitytypePublications-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.grantfulltextnone-
item.fulltextNo Fulltext-
item.openairetypeArticle-
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

15
checked on Jan 21, 2025

Page view(s)

20
checked on Jan 21, 2025

Google ScholarTM

Check

Altmetric

Altmetric


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