A conjecture on strong magic labelings of 2-regular graphs (Q1043585): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: On the degrees of a strongly vertex-magic graph / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Totally magic graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4379748 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Solution of the conjecture: if \(n\equiv 0 \pmod 4\), \(n>4\), then \(K_n\) has a super vertex-magic total labeling / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Vertex‐Magic Total Labelings of Regular Graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Magic Valuations of Finite Graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4537240 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3003881 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4329137 / rank | |||
Normal rank |
Revision as of 06:15, 2 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A conjecture on strong magic labelings of 2-regular graphs |
scientific article |
Statements
A conjecture on strong magic labelings of 2-regular graphs (English)
0 references
9 December 2009
0 references
labeling
0 references
strong vertex-magic
0 references
strong edge-magic
0 references
super vertex-magic
0 references
2-regular
0 references
0 references