Chordal intersection graphs of bands (Q4515365)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1528802
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Chordal intersection graphs of bands |
scientific article; zbMATH DE number 1528802 |
Statements
Chordal intersection graphs of bands (English)
0 references
13 November 2000
0 references
chordal
0 references
semigroup
0 references
band
0 references
characterization
0 references
0.851688027381897
0 references
A graph \(G\) is said to be chordal if it contains no cycle with \(n\) vertices (\(n\geq 4\)) as an induced subgraph. Let \(S\) be a semigroup. Denote by \(G(S)\) a graph which has as vertices all subsemigroups of \(S\) with \(AB\) an edge of \(G(S)\) iff \(A\not = B\) and \(A\cap B \not =\varnothing\). The author obtains a characterization of bands \(S\) (semigroups in which any element is idempotent) whose graphs \(G(S)\) are chordal.
0 references
