The quantifier semigroup for bipartite graphs (Q547781)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The quantifier semigroup for bipartite graphs |
scientific article; zbMATH DE number 5913181
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The quantifier semigroup for bipartite graphs |
scientific article; zbMATH DE number 5913181 |
Statements
The quantifier semigroup for bipartite graphs (English)
0 references
24 June 2011
0 references
Summary: In a bipartite graph there are two widely encountered monotone mappings from subsets of one side of the graph to subsets of the other side: one corresponds to the quantifier ``there exists a neighbor in the subset'' and the other to the quantifier ``all neighbors are in the subset''. These mappings generate a partially ordered semigroup which we characterize in terms of ``run-unimodal'' words.
0 references
0.7153725028038025
0 references
0.7126136422157288
0 references
0.7091441750526428
0 references