IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v33y2017i1d10.1007_s10878-015-9966-7.html
   My bibliography  Save this article

Graphs with multiplicative vertex-coloring 2-edge-weightings

Author

Listed:
  • Joanna Skowronek-Kaziów

    (University of Zielona Góra)

Abstract

A k-weighting w of a graph is an assignment of an integer weight $$w(e)\in \{1,...k\}$$ w ( e ) ∈ { 1 , . . . k } to each edge e. Such an edge weighting induces a vertex coloring c defined by $$c(v)=\mathop {\displaystyle {\prod }}\limits _{v\in e}w(e).$$ c ( v ) = ∏ v ∈ e w ( e ) . A k-weighting of a graph G is multiplicative vertex-coloring if the induced coloring c is proper, i.e., $$c(u)\ne c(v)$$ c ( u ) ≠ c ( v ) for any edge $$uv\in E(G).$$ u v ∈ E ( G ) . This paper studies the parameter $$\mu (G),$$ μ ( G ) , which is the minimum k for which G has a multiplicative vertex-coloring k-weighting. Chang, Lu, Wu, Yu investigated graphs with additive vertex-coloring 2-weightings (they considered sums instead of products of incident edge weights). In particular, they proved that 3-connected bipartite graphs, bipartite graphs with the minimum degree 1, and r-regular bipartite graphs with $$r\ge 3$$ r ≥ 3 permit an additive vertex-coloring 2-weighting. In this paper, the multiplicative version of the problem is considered. It was shown in Skowronek-Kaziów (Inf Process Lett 112:191–194, 2012) that $$\mu (G)\le 4$$ μ ( G ) ≤ 4 for every graph G. It was also proved that every 3-colorable graph admits a multiplicative vertex-coloring 3 -weighting. A natural problem to consider is whether every 2-colorable graph (i.e., a bipartite graph) has a multiplicative vertex-coloring 2-weighting. But the answer is no, since the cycle $$C_{6}$$ C 6 and the path $$P_{6}$$ P 6 do not admit a multiplicative vertex-coloring 2-weighting. The paper presents several classes of 2-colorable graphs for which $$\mu (G)=2$$ μ ( G ) = 2 , including trees with at least two adjacent leaf edges, bipartite graphs with the minimum degree 3 and bipartite graphs $$G=(A,B,E)$$ G = ( A , B , E ) with even $$\left| A\right| $$ A or $$\left| B\right| $$ B .

Suggested Citation

  • Joanna Skowronek-Kaziów, 2017. "Graphs with multiplicative vertex-coloring 2-edge-weightings," Journal of Combinatorial Optimization, Springer, vol. 33(1), pages 333-338, January.
  • Handle: RePEc:spr:jcomop:v:33:y:2017:i:1:d:10.1007_s10878-015-9966-7
    DOI: 10.1007/s10878-015-9966-7
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-015-9966-7
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s10878-015-9966-7?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Haiying Wang, 2007. "On the adjacent vertex-distinguishing total chromatic numbers of the graphs with Δ (G) = 3," Journal of Combinatorial Optimization, Springer, vol. 14(1), pages 87-109, July.
    2. Hervé Hocquard & Mickaël Montassier, 2013. "Adjacent vertex-distinguishing edge coloring of graphs with maximum degree Δ," Journal of Combinatorial Optimization, Springer, vol. 26(1), pages 152-160, July.
    3. Weifan Wang & Yiqiao Wang, 2010. "Adjacent vertex distinguishing edge-colorings of graphs with smaller maximum average degree," Journal of Combinatorial Optimization, Springer, vol. 19(4), pages 471-485, May.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Yi Wang & Jian Cheng & Rong Luo & Gregory Mulley, 2016. "Adjacent vertex-distinguishing edge coloring of 2-degenerate graphs," Journal of Combinatorial Optimization, Springer, vol. 31(2), pages 874-880, February.
    2. Junlei Zhu & Yuehua Bu & Yun Dai, 2018. "Upper bounds for adjacent vertex-distinguishing edge coloring," Journal of Combinatorial Optimization, Springer, vol. 35(2), pages 454-462, February.
    3. Chengchao Yan & Danjun Huang & Dong Chen & Weifan Wang, 2014. "Adjacent vertex distinguishing edge colorings of planar graphs with girth at least five," Journal of Combinatorial Optimization, Springer, vol. 28(4), pages 893-909, November.
    4. Zhuoya Liu & Changqing Xu, 2022. "Adjacent vertex distinguishing edge coloring of IC-planar graphs," Journal of Combinatorial Optimization, Springer, vol. 43(4), pages 710-726, May.
    5. Enqiang Zhu & Chanjuan Liu & Jiguo Yu, 2020. "Neighbor product distinguishing total colorings of 2-degenerate graphs," Journal of Combinatorial Optimization, Springer, vol. 39(1), pages 72-76, January.
    6. Jingjing Huo & Yiqiao Wang & Weifan Wang, 2017. "Neighbor-sum-distinguishing edge choosability of subcubic graphs," Journal of Combinatorial Optimization, Springer, vol. 34(3), pages 742-759, October.
    7. Zengtai Gong & Chen Zhang, 2023. "Adjacent Vertex Distinguishing Coloring of Fuzzy Graphs," Mathematics, MDPI, vol. 11(10), pages 1-25, May.
    8. Huijuan Wang & Lidong Wu & Weili Wu & Jianliang Wu, 2014. "Minimum number of disjoint linear forests covering a planar graph," Journal of Combinatorial Optimization, Springer, vol. 28(1), pages 274-287, July.
    9. Hervé Hocquard & Mickaël Montassier, 2013. "Adjacent vertex-distinguishing edge coloring of graphs with maximum degree Δ," Journal of Combinatorial Optimization, Springer, vol. 26(1), pages 152-160, July.
    10. Xiaohan Cheng & Jianliang Wu, 2018. "The adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least eleven," Journal of Combinatorial Optimization, Springer, vol. 35(1), pages 1-13, January.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jcomop:v:33:y:2017:i:1:d:10.1007_s10878-015-9966-7. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.