In this paper, split graphs with a regular endomorphism monoid are characterized explicitly.
Split dimension of graphs
โ Scribed by Arkady A. Chernyak; Zhanna A. Chernyak
- Publisher
- Elsevier Science
- Year
- 1991
- Tongue
- English
- Weight
- 380 KB
- Volume
- 89
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
โฆ Synopsis
Chernyak,
A.A. and Z.A. Chernyak, Split dimension of graphs, Discrete Mathematics 89 (1991) l-6.
๐ SIMILAR VOLUMES
It is proved that a split graph is an absolute retract of split graphs if and only if a partition of its vertex set into a stable set and a complete set is unique or it is a complete split graph. Three equivalent conditions for a split graph to be an absolute retract of the class of all graphs are g
For a graph G, dim G is defined to be the least natural number n such that G is an induced subgraph of a categorial (or direct) product of n complete graphs. The dimension of sums of graphs has been studied in [3] and [8]. The aim if this article is to improve the upper estimates achieved by Poljak
Wallis, W.D. and J. Wu, On clique partitions of split graphs, Discrete Mathematics 92 (1991) 427-429. Split graphs are graphs formed by taking a complete graph and an empty graph disjoint from it and some or all of the possible edges joining the two. We prove that the problem of deciding the clique