A 2-regular graph has a prime labeling if and only if it has at most one odd component (Q2041701)
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: A 2-regular graph has a prime labeling if and only if it has at most one odd component |
scientific article; zbMATH DE number 7374562
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A 2-regular graph has a prime labeling if and only if it has at most one odd component |
scientific article; zbMATH DE number 7374562 |
Statements
A 2-regular graph has a prime labeling if and only if it has at most one odd component (English)
0 references
23 July 2021
0 references
prime labeling
0 references
regular graph
0 references
graph labeling
0 references
0.8321423530578613
0 references
0.809542715549469
0 references
