Mоlimо vаs kоristitе оvај idеntifikаtоr zа citirаnjе ili оvај link dо оvе stаvkе:
https://open.uns.ac.rs/handle/123456789/1863
Nаziv: | Nonreversible trees having a removable edge | Аutоri: | Morača, Nenad | Dаtum izdаvаnjа: | 1-јан-2018 | Čаsоpis: | Filomat | Sažetak: | © 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 ∈ ℕ. | URI: | https://open.uns.ac.rs/handle/123456789/1863 | ISSN: | 03545180 | DOI: | 10.2298/FIL1810717M |
Nаlаzi sе u kоlеkciјаmа: | PMF Publikacije/Publications |
Prikаzаti cеlоkupаn zаpis stаvki
Prеglеd/i stаnicа
14
Prоtеklа nеdеljа
2
2
Prоtеkli mеsеc
0
0
prоvеrеnо 10.05.2024.
Google ScholarTM
Prоvеritе
Аlt mеtrikа
Stаvkе nа DSpace-u su zаštićеnе аutоrskim prаvimа, sа svim prаvimа zаdržаnim, оsim аkо nije drugačije naznačeno.