Total edge irregularity strength of complete graphs and complete bipartite graphs (Q960943): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Irregularity strength of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On irregular total labellings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3824455 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the irregularity strength of them ×n grid / rank
 
Normal rank
Property / cites work
 
Property / cites work: On graph irregularity strength / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Representatives of Subsets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total edge irregularity strength of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge weights and vertex colours / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Tight Bound on the Irregularity Strength of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Irregularity strength of the toroidal grid / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2723258 / rank
 
Normal rank

Latest revision as of 15:47, 2 July 2024

scientific article
Language Label Description Also known as
English
Total edge irregularity strength of complete graphs and complete bipartite graphs
scientific article

    Statements

    Total edge irregularity strength of complete graphs and complete bipartite graphs (English)
    0 references
    0 references
    0 references
    0 references
    29 March 2010
    0 references
    0 references
    irregular labelling
    0 references
    total labelling
    0 references
    complete graphs
    0 references
    complete bipartite graphs
    0 references
    irregularity strength
    0 references
    0 references