路的补图的自同态的弱逆
The Pseudo-Inverses of an Endomorphism of the Complement Graph of Path
DOI: 10.12677/OJNS.2022.106130, PDF,   
作者: 张廷杰：河南科技大学数学与统计学院，河南 洛阳
关键词: 自同态；弱逆；路；Endomorphism； Pseudo-Inverse； Path
摘要: 在半群理论中，正则元素的逆是非常重要的，尤其受到学者的重视。因此刻画各种群的正则元素的逆是非常重要的。路的补图是纯整的，因此也是正则的。在本篇文章中，我们详细刻画路的补图的自同态的弱逆，并且得到了这些弱逆的个数。
Abstract: In semigroup theory, the inverse of regular elements is very important, and has been paid more attention by scholars. Therefore, it is very important to characterize various inverses of a regular element of a group. The complement graph of path is orthodox, then is regular. In this paper, we give an explicitly characterization of pseudo-inverses of an endomorphism of the complement graph of a path. The number of these pseudo-inverses is also obtained.
文章引用：张廷杰. 路的补图的自同态的弱逆[J]. 自然科学, 2022, 10(6): 1167-1175. https://doi.org/10.12677/OJNS.2022.106130

参考文献

[1] Hou, H., Luo, Y. and Cheng, Z. (2008) The Endomorphism Monoid of . European Journal of Combinatorics, 29, 1173-1185. [Google Scholar] [CrossRef] 
[2] Gu, R. and Hou, H. (2020) Unicyclic Graphs Whose Completely Regular Endomorphisms Form a Monoid. Mathematics, 8, Article No. 240. [Google Scholar] [CrossRef] 
[3] Hou, H. and Gu, R. (2016) Split Graphs Whose Completely Regular Endomorphisms Form a Monoid. Ars Combinatoria, 127, 79-88.
[4] Hou, H. and Luo, Y. (2008) Graphs Whose Endomorphism Monoids Are Regular. Discrete Mathematics, 208, 3888- 3896. [Google Scholar] [CrossRef] 
[5] Hou, H., Fan, X. and Luo, Y. (2009) Endomorphism Types of Generalized Polygons. Southeast Asian Bulletin of Mathematics, 33, 433-441.
[6] Hou, H., Gu, R. and Song, Y. (2019) Endomorphism Spectra of Fan Graphs. Ars Combinatoria, 142, 89-99.
[7] Hou, H., Gu, R. and Shang, Y. (2014) End-Completely-Regular and End-Inverse Joins of Graphs. Ars Combinatoria, 117, 387-398. [Google Scholar] [CrossRef] [PubMed]
[8] Fan, S. (2001) Endomorphism Spectra of Bipartite Graph with Diameter Three and Girth Six. Southeast Asian Bulletin of Mathematics, 25, 217-221. [Google Scholar] [CrossRef] 
[9] Hou, H., Gu, R. and Song, Y. (2019) Endomorphism Spectra of Fan Graphs. Ars Combinatoria, 142, 89-99.
[10] Knauer, U. and Nieporte, M. (1989) Endomorphisms of Graphs I, the Monoid of Strong Endomorphisms. Archiv der Mathematik, 52, 607-614. [Google Scholar] [CrossRef] 
[11] Kelarev, A.V., Ryan, J. and Yearwood, J. (2009) Cayley Graphs as Classifiers for Data Mining: The Influence of Asymmetries. Discrete Mathematics, 309, 5360-5369. [Google Scholar] [CrossRef] 
[12] Klearev, A.V. (2003) Graph Algebras and Automata. Marcel Dekker, New York. [Google Scholar] [CrossRef] 
[13] Kelarev, A.V. and Praeger, C.E. (2003) On Transitive Cayley Graphs of Groups and Semigroups. European Journal of Combinatorics, 24, 59-72. [Google Scholar] [CrossRef] 
[14] Kelarev, A.V. (2004) Labelled Cayley Graphs and Minimal Automata. The Australasian Journal of Combinatorics, 30, 95-101.
[15] Kelarev, A.V. (2002) Ring Constructions and Applications. World Scientific, River Edge. [Google Scholar] [CrossRef] 
[16] Li, W. (2005) Various Inverses of a Strong Endomorphism of a Graph. Discrete Mathematics, 300, 245-255. [Google Scholar] [CrossRef] 
[17] Li, W. (1994) A Regular Endomorphism of a Graph and Its Inverses. Mathematika, 41, 189-198. [Google Scholar] [CrossRef]