A class of antimagic join graphs (Q1949669): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10114-012-1559-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2097491593 / rank
 
Normal rank
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
links / mardi / namelinks / mardi / name
 

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
    0 references
    0 references
    0 references
    14 May 2013
    0 references
    0 references
    antimagic labeling
    0 references
    antimagic graph
    0 references
    join graphs
    0 references
    0 references