Please use this identifier to cite or link to this item: http://cmuir.cmu.ac.th/jspui/handle/6653943832/60552
Full metadata record
DC FieldValueLanguage
dc.contributor.authorSr Arwornen_US
dc.contributor.authorU. Knaueren_US
dc.contributor.authorS. Leeratanavaleeen_US
dc.date.accessioned2018-09-10T03:45:05Z-
dc.date.available2018-09-10T03:45:05Z-
dc.date.issued2008-06-28en_US
dc.identifier.issn0012365Xen_US
dc.identifier.other2-s2.0-41549100031en_US
dc.identifier.other10.1016/j.disc.2007.06.007en_US
dc.identifier.urihttps://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=41549100031&origin=inwarden_US
dc.identifier.urihttp://cmuir.cmu.ac.th/jspui/handle/6653943832/60552-
dc.description.abstractWe determine the number of locally strong endomorphisms of directed and undirected paths-direction here is in the sense of a bipartite graph from one partition set to the other. This is done by the investigation of congruence classes, leading to the concept of a complete folding, which is used to characterize locally strong endomorphisms of paths. A congruence belongs to a locally strong endomorphism if and only if the number l of congruence classes divides the length of the original path and the points of the path are folded completely into the l classes, starting from 0 to l and then back to 0, then again back to l and so on. It turns out that for paths locally strong endomorphisms form a monoid if and only if the length of the path is prime or equal to 4 in the undirected case and in the directed case also if the length is 8. Finally some algebraic properties of these monoids are described. © 2007 Elsevier B.V. All rights reserved.en_US
dc.subjectMathematicsen_US
dc.titleLocally strong endomorphisms of pathsen_US
dc.typeJournalen_US
article.title.sourcetitleDiscrete Mathematicsen_US
article.volume308en_US
article.stream.affiliationsChiang Mai Universityen_US
article.stream.affiliationsUniversitat Oldenburgen_US
Appears in Collections:CMUL: Journal Articles

Files in This Item:
There are no files associated with this item.


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