Product irregularity strength of graphs with small clique cover number

DOI10.26493/2590-9770.1307.CB4zbMATH Open1498.05091arXiv1806.10500OpenAlexW3133734678MaRDI QIDQ5045247FDOQ5045247

Authors: Daniil Baldouski 

Publication date: 4 November 2022

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

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.

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

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

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)

Cites Work

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

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)