In this paper we give an account of the different ways to define homomorphisms of graphs. This leads to six classes of endomorphisms for each gt aph. which as sets always form a chain by inclusion. The endomorphism spectrum is defined as a six-tuple containing the cardinalities of these six sets, an
Endomorphism—Regularity of Split Graphs
✍ Scribed by Weimin Li; Jianfei Chen
- Publisher
- Elsevier Science
- Year
- 2001
- Tongue
- English
- Weight
- 126 KB
- Volume
- 22
- Category
- Article
- ISSN
- 0195-6698
No coin nor oath required. For personal study only.
✦ Synopsis
In this paper, split graphs with a regular endomorphism monoid are characterized explicitly.
📜 SIMILAR VOLUMES
It is shown that given a finite or infinite graph H and a subsemigroup B of its endomorphism semigroup End H, there exists a graph G such that (i) H is an induced subgraph of G, (ii) H is stable by every fe End 6. (iii) every f~ End G is uniquely determined by its restriction to H, (iv) the restric
Given r 3 3 and 1 s A s r, we determine all values of k for which every r-regular graph with edge-connectivity A has a k-factor. Some of the earliest results in graph theory are due to Petersen [8] and concern factors in graphs. Among others, Petersen proved that a regular graph of even degree has a
## Chernyak, A.A. and Z.A. Chernyak, Split dimension of graphs, Discrete Mathematics 89 (1991) l-6.