Characterizations of consistent marked graphs (Q1874545)
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: Characterizations of consistent marked graphs |
scientific article; zbMATH DE number 1915704
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Characterizations of consistent marked graphs |
scientific article; zbMATH DE number 1915704 |
Statements
Characterizations of consistent marked graphs (English)
0 references
25 May 2003
0 references
A marked graph is a graph in which to each vertex a sign \(+\) or \(-\) is assigned. A marked graph is called consistent, if on each of its cycles there is an even number of \(-\) signs. Some theorems are proved. Some of them characterize consistent graphs. Two algorithms are described; the first of them recognizes whether a given 2-connected marked graph is consistent. The introduction of the above-mentioned concepts is motivated by their application in social sciences.
0 references
