On the Independence Number of Cayley Digraphs of Clifford Semigroups

Krittawit Limkul and Sayan Panma ()
Additional contact information
Krittawit Limkul: Doctoral Program in Mathematics, Graduate School, Chiang Mai University, Chiang Mai 50200, Thailand
Sayan Panma: Department of Mathematics, Faculty of Science, Chiang Mai University, Chiang Mai 50200, Thailand

Mathematics, 2023, vol. 11, issue 16, 1-18

Abstract: Let S be a Clifford semigroup and A a subset of S . We write C a y ( S , A ) for the Cayley digraph of a Clifford semigroup S relative to A . The (weak, path, weak path) independence number of a graph is the maximum cardinality of an (weakly, path, weakly path) independent set of vertices in the graph. In this paper, we characterize maximal connected subdigraphs of C a y ( S , A ) and apply these results to determine the (weak, path, weak path) independence number of C a y ( S , A ) .

Keywords: Cayley digraph; Clifford semigroup; independent set; independence number (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2023
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2227-7390/11/16/3445/pdf (application/pdf)
https://www.mdpi.com/2227-7390/11/16/3445/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:11:y:2023:i:16:p:3445-:d:1213092

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().