Does the degree sequence of an (almost) regular graph determine if it possesses a strong vertex-magic total labeling? (Q6644906)
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: Does the degree sequence of an (almost) regular graph determine if it possesses a strong vertex-magic total labeling? |
scientific article; zbMATH DE number 7950644
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Does the degree sequence of an (almost) regular graph determine if it possesses a strong vertex-magic total labeling? |
scientific article; zbMATH DE number 7950644 |
Statements
Does the degree sequence of an (almost) regular graph determine if it possesses a strong vertex-magic total labeling? (English)
0 references
28 November 2024
0 references
spectrum of magic constants
0 references
Gray's theorem
0 references
0 references
