Orientable \(\mathbb{Z}_N\)-distance magic graphs (Q1717208): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q5403272 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3331243 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3517253 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Note on group distance magic graphs \(G[C_4]\) / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Distance magic graphs \(G \times C_n\) / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Distance magic circulant graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5374245 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4595651 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q2869301 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A dynamic survey of graph labeling / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3999001 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3005852 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On zero-sum partitions and anti-magic trees / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4432951 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3532230 / rank | |||
Normal rank |
Revision as of 02:02, 18 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Orientable \(\mathbb{Z}_N\)-distance magic graphs |
scientific article |
Statements
Orientable \(\mathbb{Z}_N\)-distance magic graphs (English)
0 references
7 February 2019
0 references
distance magic graph
0 references
digraph
0 references
flow graph
0 references