On bounds for the product irregularity strength of graphs
DOI10.1007/S00373-014-1458-5zbMATH Open1321.05043OpenAlexW2010422690MaRDI QIDQ497327FDOQ497327
Authors: Ratko Darda, Ademir Hujdurović
Publication date: 24 September 2015
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-014-1458-5
Recommendations
complete multipartite graphspanning subgraphmultiplication table problemproduct irregularity strength
Trees (05C05) Coloring of graphs and hypergraphs (05C15) 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?)
- Product irregularity strength of graphs
- Characterization of product anti-magic graphs of large order
- Product irregularity strength of certain graphs
- Title not available (Why is that?)
- Localized factorizations of integers
Cited In (7)
- Title not available (Why is that?)
- Product irregularity strength of certain graphs
- Graphs with multiplicative vertex-coloring 2-edge-weightings
- Product irregularity strength of graphs with small clique cover number
- Title not available (Why is that?)
- On sets of integers with restrictions on their products
- Product irregularity strength of graphs
This page was built for publication: On bounds for the product irregularity strength of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q497327)