Antimagic labeling of the lexicographic product graph \(K_{m,n}[P_k]\) (Q1993366): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1007/s11786-017-0327-z / rank
Normal rank
 
Property / cites work
 
Property / cites work: Q3999001 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dense graphs are antimagic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Antimagic Labeling of Regular Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular graphs are antimagic / 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: Anti-magic labeling of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On anti-magic labeling for graph products / rank
 
Normal rank
Property / cites work
 
Property / cites work: Construction of antimagic labeling for the Cartesian product of regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A class of antimagic join graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Antimagic labelings of join graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Antimagicness of generalized corona and snowflake graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dynamic survey of graph labeling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benjamin Franklin's Numbers / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S11786-017-0327-Z / rank
 
Normal rank

Latest revision as of 16:58, 16 December 2024

scientific article
Language Label Description Also known as
English
Antimagic labeling of the lexicographic product graph \(K_{m,n}[P_k]\)
scientific article

    Statements

    Identifiers