Product irregularity strength of graphs with small clique cover number

DOI10.26493/2590-9770.1307.CB4MaRDI QIDQ5045247zbMATH OpenOpenAlexFDO

Authors Daniil Baldouski

Publication date 4 November 2022

Published in The Art of Discrete and Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1806.10500

zbMATH Keywords

product irregularity strengthclique-cover number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Abstract: For a graph $X$ without isolated vertices and without isolated edges, a product-irregular labelling $omega:E(X)ightarrow1,2,ldots,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 exist 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.

Recommendations

• Product irregularity strength of certain graphs
• On bounds for the product irregularity strength of graphs
• Product irregularity strength of graphs
• On edge irregularity strength of products of certain families of graphs with path \(P_2\).
• Total edge irregularity strength of strong product of cycles and paths

Cites work

• scientific article; zbMATH DE number 4097437 (Why is no real title available?)
• A new upper bound for the irregularity strength of graphs
• Bertrand's postulate, the prime number theorem and product anti-magic graphs
• Characterization of product anti-magic graphs of large order
• Graphs with multiplicative vertex-coloring 2-edge-weightings
• Localized factorizations of integers
• Multiplicative vertex-colouring weightings of graphs
• On bounds for the product irregularity strength of graphs
• On graph irregularity strength
• On the irregularity strength of dense graphs
• On the irregularity strength of trees
• Product irregularity strength of certain graphs
• Product irregularity strength of graphs
• The distribution of integers with a divisor in a given interval

Cited in

(3)

• Product irregularity strength of certain graphs
• On bounds for the product irregularity strength of graphs
• Product irregularity strength of graphs

This page was built for publication: Product irregularity strength of graphs with small clique cover number

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5045247)