Complexity and algorithms for neighbor-sum-2-distinguishing \(\{1,3\}\)-edge-weighting of graphs

DOI10.1016/j.tcs.2022.01.003OpenAlexW4206739806MaRDI QIDQ2077391

Priyamvada, B. S. Panda

Publication date: 21 February 2022

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2022.01.003

zbMATH Keywords

NP-completeCartesian product of graphscentral graphsneighbor-sum-2-distinguishing edge-weighting

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (2)

Exact square coloring of graphs resulting from some graph operations and products ⋮ Complexity and algorithms for injective edge coloring of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• The 3-flow conjecture, factors modulo \(k\), and the 1-2-3-conjecture
• Vertex-coloring edge-weightings: towards the 1-2-3-conjecture
• Connectivity of Cartesian products of graphs
• Neighbour-sum-2-distinguishing edge-weightings: doubling the 1-2-3 conjecture
• Edge weights and vertex colours
• Edge weights and vertex colours: minimizing sum count
• \(L(2,1)\)-labelings of Cartesian products of two cycles
• Injective coloring of some subclasses of bipartite graphs and chordal graphs
• On Equitable Coloring of Central Graphs and Total Graphs
• On the total and AVD-total coloring of graphs
• Hard tiling problems with simple tiles

This page was built for publication: Complexity and algorithms for neighbor-sum-2-distinguishing \(\{1,3\}\)-edge-weighting of graphs