An identity involving 3-regular graphs (Q1917501)
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 897584
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An identity involving 3-regular graphs |
scientific article; zbMATH DE number 897584 |
Statements
An identity involving 3-regular graphs (English)
0 references
7 July 1996
0 references
The author shows that if \(M\) is a perfect matching in a 3-regular graph \(G\), then the number of positive-minus-negative \(M\)-covers of \(G\) is equal to the number of positive-minus-negative \(M\)-partitions of \(G\). Also, either there are no \(M\)-partitions of \(G\), or every \(M\)-partition and every \(M\)-cover has the same sign.
0 references
3-regular graphs
0 references
perfect matching
0 references
\(M\)-partitions
0 references
\(M\)-cover
0 references
0.8068428635597229
0 references
0.7653371095657349
0 references
0.7594473958015442
0 references
0.7501736879348755
0 references
