An identity involving 3-regular graphs (Q1917501): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (3 intermediate revisions by 2 users not shown) | |||
| Property / reviewed by | |||
| Property / reviewed by: Q1801309 / rank | |||
| Property / reviewed by | |||
| Property / reviewed by: B. L. Raktoe / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A short algorithm to delete singular junctions in bond graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Bond graphs. II: Causality and singularity / rank | |||
Normal rank | |||
Latest revision as of 13:12, 24 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An identity involving 3-regular graphs |
scientific article |
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
