INVERSE MONOIDS OF GRAPHS

被引：0
|
作者：
李为民
机构：
来源：
Acta Mathematicae Applicatae Sinica(English Series) | 2000年 / 01期
关键词：
Endomorphism; inverse monoid; graph;
D O I：
暂无
中图分类号：
O157.5 [图论];
学科分类号：
摘要：
In this paper we first present a combinatorial characterization of an inverse monoid of a graph. Then using this we prove that a bipartite graph with an inverse monoid is uniquely K2, and that a graph G has an inverse monoid if and only if the join of G and a complete graph also has an inverse monoid.
引用
收藏
页码：93 / 99
页数：7
相关论文
共 50 条
  • [31] Erratum to: Factorizable inverse monoids
    D. G. FitzGerald
    Semigroup Forum, 2010, 80 (3) : 510 - 510
  • [32] Congruences on a Semilattice of Inverse Monoids
    Chen, Zhaoying
    Zhang, Sumei
    Wang, Xiuqing
    PROCEEDINGS OF 2019 2ND INTERNATIONAL CONFERENCE ON BIG DATA TECHNOLOGIES (ICBDT 2019), 2019, : 182 - 186
  • [33] Inverse monoids of Mobius type
    Choi, K
    Lim, Y
    JOURNAL OF ALGEBRA, 2000, 223 (01) : 283 - 294
  • [34] Prefix monoids of groups and right units of special inverse monoids
    Dolinka, Igor
    Gray, Robert D.
    FORUM OF MATHEMATICS SIGMA, 2023, 11
  • [35] GROUPS AND MONOIDS OF REGULAR GRAPHS (AND OF GRAPHS WITH BOUNDED DEGREES)
    HELL, P
    NESETRIL, J
    CANADIAN JOURNAL OF MATHEMATICS-JOURNAL CANADIEN DE MATHEMATIQUES, 1973, 25 (02): : 239 - 251
  • [36] GROUPS AND MONOIDS OF REGULAR GRAPHS (AND OF GRAPHS WITH BOUNDED DEGREES)
    HELL, P
    NESETRIL, J
    NOTICES OF THE AMERICAN MATHEMATICAL SOCIETY, 1972, 19 (04): : A501 - &
  • [37] Refinement monoids and adaptable separated graphs
    Pere Ara
    Joan Bosa
    Enrique Pardo
    Semigroup Forum, 2020, 101 : 19 - 36
  • [38] Refinement monoids and adaptable separated graphs
    Ara, Pere
    Bosa, Joan
    Pardo, Enrique
    SEMIGROUP FORUM, 2020, 101 (01) : 19 - 36
  • [39] Endomorphism monoids of generalized split graphs
    Lu, Dancheng
    Wu, Tongsuo
    ARS COMBINATORIA, 2013, 111 : 357 - 373
  • [40] GRAPHS AND FREE PARTIALLY COMMUTATIVE MONOIDS
    KONIG, R
    THEORETICAL COMPUTER SCIENCE, 1991, 78 (02) : 319 - 346
12345