Please use this identifier to cite or link to this item:
http://cmuir.cmu.ac.th/jspui/handle/6653943832/58805
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Yanisa Chaiya | en_US |
dc.contributor.author | Chollawat Pookpienlert | en_US |
dc.contributor.author | Nuttawoot Nupo | en_US |
dc.contributor.author | Sayan Panma | en_US |
dc.date.accessioned | 2018-09-05T04:32:42Z | - |
dc.date.available | 2018-09-05T04:32:42Z | - |
dc.date.issued | 2018-05-09 | en_US |
dc.identifier.issn | 22277390 | en_US |
dc.identifier.other | 2-s2.0-85046620077 | en_US |
dc.identifier.other | 10.3390/math6050076 | en_US |
dc.identifier.uri | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85046620077&origin=inward | en_US |
dc.identifier.uri | http://cmuir.cmu.ac.th/jspui/handle/6653943832/58805 | - |
dc.description.abstract | © 2018 by the author. Let Knbe a complete graph on n vertices. Denote by SKnthe set of all subgraphs of Kn. For each G, H ∈ SKn, the ring sum of G and H is a graph whose vertex set is V(G) ∪ V(H) and whose edges are that of either G or H, but not of both. Then SKnis a semigroup under the ring sum. In this paper, we study Green's relations on SKnand characterize ideals, minimal ideals, maximal ideals, and principal ideals of SKn. Moreover, maximal subsemigroups and a class of maximal congruences are investigated. Furthermore, we prescribe the natural order on SKnand consider minimal elements, maximal elements and covering elements of SKnunder this order. | en_US |
dc.subject | Mathematics | en_US |
dc.title | On the semigroup whose elements are subgraphs of a complete graph | en_US |
dc.type | Journal | en_US |
article.title.sourcetitle | Mathematics | en_US |
article.volume | 6 | en_US |
article.stream.affiliations | Thammasat University | en_US |
article.stream.affiliations | Chiang Mai University | en_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.