An iterative approach to graph irregularity strength (Q708356): 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 the irregularity strength of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4028274 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3824455 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On graph irregularity strength / rank
 
Normal rank
Property / cites work
 
Property / cites work: The irregularity strength of \(tP_ 3\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4873753 / 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 regular graphs / rank
 
Normal rank

Revision as of 07:14, 3 July 2024

scientific article
Language Label Description Also known as
English
An iterative approach to graph irregularity strength
scientific article

    Statements

    An iterative approach to graph irregularity strength (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    11 October 2010
    0 references
    irregular labeling
    0 references
    irregularity strength
    0 references

    Identifiers