UP - logo
University of Primorska University Library (UPUK)
PDF
  • Product irregularity strength of graphs with small clique cover number [Elektronski vir]
    Baldouski, Daniil, 1998-
    For a graph X without isolated vertices and without isolated edges, a product-irregular labelling ω : E(X) → {1, 2, …, s}, first defined by Anholcer in 2009, is a labelling of the edges of X such ... that for any two distinct vertices u and v of X the product of labels of the edges incident with u is different from the product of labels of the edges incident with v. The minimal s for which there exists a product irregular labeling is called the product irregularity strength of X and is denoted by ps(X). Clique cover number of a graph is the minimum number of cliques that partition its vertex-set. In this paper we prove that connected graphs with clique cover number 2 or 3 have the product-irregularity strength equal to 3, with some small exceptions.
    Source: The art of discrete and applied mathematics [Elektronski vir]. - ISSN 2590-9770 (Vol. 5, iss. 1, art. P1.04, 2022, str. 1-14)
    Type of material - e-article ; adult, serious
    Publish date - 2022
    Language - english
    COBISS.SI-ID - 172998915

    Link(s):

    https://adam-journal.eu/index.php/ADAM/article/view/1307
    https://doi.org/10.26493/2590-9770.1307.cb4
    DOI

Shelf entry