On the Independence Number of Cayley Digraphs of Clifford Semigroups

Author:

Limkul Krittawit1ORCID,Panma Sayan2ORCID

Affiliation:

1. Doctoral Program in Mathematics, Graduate School, Chiang Mai University, Chiang Mai 50200, Thailand

2. Department of Mathematics, Faculty of Science, Chiang Mai University, Chiang Mai 50200, Thailand

Abstract

Let S be a Clifford semigroup and A a subset of S. We write Cay(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 Cay(S,A) and apply these results to determine the (weak, path, weak path) independence number of Cay(S,A).

Publisher

MDPI AG

Subject

General Mathematics,Engineering (miscellaneous),Computer Science (miscellaneous)

Reference21 articles.

1. Cayley graphs and interconnection networks;Heydemann;Graph Symmetry Algebr. Methods Appl.,1997

2. Some mathematical properties of cayley digraphs with applications to interconnection network design;Xiao;Int. J. Comput. Math.,2005

3. Characterization of digraphs of right (left) zero unions of groups;Arworn;Thai J. Math.,2003

4. On the Cayley graphs of Brandt semigroups;Hao;Commun. Algebra,2011

5. Cayley graphs as classifiers for data mining: The influence of asymmetries;Kelarev;Discret. Math.,2009

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3