A class of antimagic join graphs (Q1949669): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q3999001 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A new class of antimagic Cartesian product graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Dense graphs are antimagic / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Regular bipartite graphs are antimagic / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Vertex-magic labelings of regular graphs. II. / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Anti‐magic graphs via the Combinatorial NullStellenSatz / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Benjamin Franklin's Numbers / rank | |||
Normal rank |
Latest revision as of 11:14, 6 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A class of antimagic join graphs |
scientific article |
Statements
A class of antimagic join graphs (English)
0 references
14 May 2013
0 references
antimagic labeling
0 references
antimagic graph
0 references
join graphs
0 references