The multiplicity of 1-factors in total graphs (Q1123908)
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: Publication:1123908 |
scientific article; zbMATH DE number 4110743
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The multiplicity of 1-factors in total graphs |
scientific article; zbMATH DE number 4110743 |
Statements
The multiplicity of 1-factors in total graphs (English)
0 references
1988
0 references
Let H be a connected total graph of order \(2n\geq 6.\) The author shows that H has at least 4n-4 1-factors. He also proves that the multiplicity of 1-factors in H is exactly 4n-4 if and only if H is a total graph of \(K_ 1+(K_ 2\cup \bar K_{n-3}).\)
0 references
total graph
0 references
1-factors
0 references
0.8187762498855591
0 references
0.7735248804092407
0 references
0.7504855990409851
0 references
