Please use this identifier to cite or link to this item:
https://open.uns.ac.rs/handle/123456789/1863
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Morača, Nenad | en |
dc.date.accessioned | 2019-09-23T10:18:12Z | - |
dc.date.available | 2019-09-23T10:18:12Z | - |
dc.date.issued | 2018-01-01 | en |
dc.identifier.issn | 03545180 | en |
dc.identifier.uri | https://open.uns.ac.rs/handle/123456789/1863 | - |
dc.description.abstract | © 2018, University of Nis. All rights reserved. A relational structure is said to be reversible iff every bijective homomorphism (condensation) of that structure is an automorphism. In the case of a binary structure 𝕏 = 〈X, ρ〉, that is equivalent to the following statement: whenever we remove finite or infinite number of edges from 𝕏, thus obtaining the structure 𝕏 ′ , we have that 𝕏 ′ ≇ 𝕏. In this paper, we prove that if a nonreversible tree 𝕏 = 〈X, ρ〉 has a removable edge (i.e. if there is 〈x, y〉 ∈ ρ such that 〈X, ρ〉 ≅ 〈X, ρ \ {〈x, y〉}〉, then it has infinitely many removable edges. We also show that the same is not true for arbitrary binary structure by constructing nonreversible digraphs having exactly n removable edges, for n ∈ ℕ. | en |
dc.relation.ispartof | Filomat | en |
dc.title | Nonreversible trees having a removable edge | en |
dc.type | Journal/Magazine Article | en |
dc.identifier.doi | 10.2298/FIL1810717M | en |
dc.identifier.scopus | 2-s2.0-85061359639 | en |
dc.identifier.url | https://api.elsevier.com/content/abstract/scopus_id/85061359639 | en |
dc.relation.lastpage | 3724 | en |
dc.relation.firstpage | 3717 | en |
dc.relation.issue | 10 | en |
dc.relation.volume | 32 | en |
item.grantfulltext | none | - |
item.fulltext | No Fulltext | - |
crisitem.author.dept | Prirodno-matematički fakultet, Departman za matematiku i informatiku | - |
crisitem.author.parentorg | Prirodno-matematički fakultet | - |
Appears in Collections: | PMF Publikacije/Publications |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.