Please use this identifier to cite or link to this item:
https://research.matf.bg.ac.rs/handle/123456789/1350
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Belardo, Francesco | en_US |
dc.contributor.author | Stanić, Zoran | en_US |
dc.contributor.author | Zaslavsky, Thomas | en_US |
dc.date.accessioned | 2024-10-02T10:49:55Z | - |
dc.date.available | 2024-10-02T10:49:55Z | - |
dc.date.issued | 2023-01-01 | - |
dc.identifier.issn | 18553966 | - |
dc.identifier.uri | https://research.matf.bg.ac.rs/handle/123456789/1350 | - |
dc.description.abstract | The total graph is built by joining the graph to its line graph by means of the incidences. We introduce a similar construction for signed graphs. Under two similar definitions of the line signed graph, we define the corresponding total signed graph and we show that it is stable under switching. We consider balance, the frustration index and frustration number, and the largest eigenvalue. In the regular case we compute the spectrum of the adjacency matrix of the total graph and the spectra of certain compositions, and we determine some with exactly two main eigenvalues. | en_US |
dc.language.iso | en | en_US |
dc.publisher | Koper : University of Primorska | en_US |
dc.relation.ispartof | Ars Mathematica Contemporanea | en_US |
dc.rights | Attribution 3.0 United States | * |
dc.rights.uri | http://creativecommons.org/licenses/by/3.0/us/ | * |
dc.subject | Bidirected graph | en_US |
dc.subject | Cartesian product graph | en_US |
dc.subject | graph eigenvalues | en_US |
dc.subject | regular signed graph | en_US |
dc.subject | signed line graph | en_US |
dc.subject | signed total graph | en_US |
dc.title | Total graph of a signed graph | en_US |
dc.type | Article | en_US |
dc.identifier.doi | 10.26493/1855-3974.2842.6b5 | - |
dc.identifier.scopus | 2-s2.0-85134018324 | - |
dc.identifier.isi | 000892434600004 | - |
dc.identifier.url | https://api.elsevier.com/content/abstract/scopus_id/85134018324 | - |
dc.contributor.affiliation | Numerical Mathematics and Optimization | en_US |
dc.relation.issn | 1855-3966 | en_US |
dc.description.rank | M22 | en_US |
dc.relation.firstpage | Article no. #P1.02 | en_US |
dc.relation.volume | 23 | en_US |
dc.relation.issue | 1 | en_US |
item.fulltext | With Fulltext | - |
item.languageiso639-1 | en | - |
item.openairetype | Article | - |
item.grantfulltext | open | - |
item.openairecristype | http://purl.org/coar/resource_type/c_18cf | - |
item.cerifentitytype | Publications | - |
crisitem.author.dept | Numerical Mathematics and Optimization | - |
crisitem.author.orcid | 0000-0002-4949-4203 | - |
Appears in Collections: | Research outputs |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
admin,+amc_2842-2.pdf | 420.04 kB | Adobe PDF | View/Open |
SCOPUSTM
Citations
7
checked on Nov 15, 2024
Page view(s)
11
checked on Nov 15, 2024
Download(s)
1
checked on Nov 15, 2024
Google ScholarTM
Check
Altmetric
Altmetric
This item is licensed under a Creative Commons License