Yazd UniversityAlgebraic Structures and Their Applications2382-97613220161101Derivations of UP-algebras by means of UP-endomorphisms120901ENAiyaredIampanUniversity of Phayao, Thailand0000-0002-0475-3320Journal Article20161101The notion of $f$-derivations of UP-algebras is introduced, some useful examples are discussed, and related properties are investigated. Moreover, we show that the fixed set and the kernel of $f$-derivations are UP-subalgebras of UP-algebras,and also give examples to show that the two sets are not UP-ideals of UP-algebras in general.https://as.yazd.ac.ir/article_901_f422878003a1475eef8b5d834bc3679e.pdfYazd UniversityAlgebraic Structures and Their Applications2382-97613220161101A Note on Artinian Primes and Second Modules2129953ENAhmadKhaksariDepartment of Mathematics, Payame Noor University, Tehran, IranJournal Article20160429 Prime submodules and artinian prime modules are characterized. Furthermore, some previous results on prime modules and second modules are generalized.https://as.yazd.ac.ir/article_953_b2552b7859f51a9b570e841a3799b41d.pdfYazd UniversityAlgebraic Structures and Their Applications2382-97613220161101On some classes of expansions of ideals in $MV$-algebras3147954ENFereshtehForuzeshFaculty of Mathematics and computing, Higher Education Complex of Bam, Kerman, Iran.MahtaBedroodDepartment of Mathematics , Shahid Bahonar University
Kerman, Iran.Journal Article20170421In this paper, we introduce the notions of expansion of ideals in $MV$-algebras, $ (\tau,\sigma)- $primary, $ (\tau,\sigma)$-obstinate and $ (\tau,\sigma)$-Boolean in $ MV- $algebras. We investigate the relations of them. For example, we show that every $ (\tau,\sigma)$-obstinate ideal of an $ MV-$ algebra is $ (\tau,\sigma)$-primary and $ (\tau,\sigma)$-Boolean. In particular, we define an expansion $ \sigma_{y} $ of ideals in an $ MV-$algebra. A characterization of expansion ideal with respect to $ \sigma_{y} $ is given. Finally, we show that the class $ C(\sigma_{y}) $ of all constant ideals relative to $ \sigma_{y} $ is a Heyting algebra.https://as.yazd.ac.ir/article_954_72d43e9972d37dc2a7361805371f5338.pdfYazd UniversityAlgebraic Structures and Their Applications2382-97613220161101A new approach to characterization of MV-algebras4970955ENSaeedRasouliDepartment of Mathematics, Persian Gulf University, Bushehr, 75169, IranJournal Article20170408By considering the notion of MV-algebras, we recall some results on enumeration of MV-algebras and we<br />carry out a study on characterization of MV-algebras of orders $2$, $3$, $4$, $5$, $6$ and $7$. We obtain that there is one non-isomorphic MV-algebra of orders $2$, $3$, $5$ and $7$ and two non-isomorphic MV-algebras of orders $4$ and $6$.https://as.yazd.ac.ir/article_955_0a544bda63302897572bdf6c822b878b.pdfYazd UniversityAlgebraic Structures and Their Applications2382-97613220161101The remoteness of the permutation code of the group $U_{6n}$71791057ENMasoomehYazdani-MoghaddamDepartment of Pure Mathematics, Faculty of Mathematical Sciences, University of Kashan, Kashan, IranRezaKahkeshaniDepartment of Pure Mathematics, Faculty of Mathematical Sciences, University of Kashan, Kashan, Iran0000-0001-8044-803XJournal Article20170629Recently, a new parameter of a code, referred to as the remoteness, has been introduced.<br />This parameter can be viewed as a dual to the covering radius. It is exactly determined for the cyclic and dihedral groups. In this paper, we consider the group $U_{6n}$ as a subgroup of $S_{2n+3}$ and obtain its remoteness. We show that the remoteness of the permutation code $U_{6n}$ is $2n+2$. Moreover, it is proved that the covering radius of $U_{6n}$ is also $2n+2$.https://as.yazd.ac.ir/article_1057_758aa9213fb349f92e6a2c3f83d75f99.pdfYazd UniversityAlgebraic Structures and Their Applications2382-97613220161101The distinguishing chromatic number of bipartite graphs of girth at least six81871061ENSaeidAlikhaniDepartment Mathematics, Yazd University
89195-741, Yazd, Iran0000-0002-1801-203XSamanehSoltaniDepartment Mathematics, Yazd University
89195-741, Yazd, IranJournal Article20171021The distinguishing number $D(G)$ of a graph $G$ is the least integer $d$ such that $G$ has a vertex labeling with $d$ labels that is preserved only by a trivial automorphism. The distinguishing chromatic number $\chi_{D}(G)$ of $G$ is defined similarly, where, in addition, $f$ is assumed to be a proper labeling. We prove that if $G$ is a bipartite graph of girth at least six with the maximum degree $\Delta (G)$, then $\chi_{D}(G)\leq \Delta (G)+1$. We also obtain an upper bound for $\chi_{D}(G)$ where $G$ is a graph with at most one cycle. Finally, we state a relationship between the distinguishing chromatic number of a graph and its spanning subgraphs.https://as.yazd.ac.ir/article_1061_d7a2c4d97e197bfadafec3fd409da617.pdf