NEIGHBOR SUM DISTINGUISHING COLORING OF SOME GRAPHS
Authors:
- 1 December 2012
- journal article
- research article
- Published by World Scientific Pub Co Pte Ltd in Discrete Mathematics, Algorithms and Applications
- Vol. 04 (04)
Abstract
A proper [k]-edge coloring of a graph G is a proper edge coloring of G using colors of the set [k] = {1, 2,…,k}. A neighbor sum distinguishing [k]-edge coloring of G is a proper [k]-edge coloring of G such that for each edge uv ∈ E(G), the sum of colors taken on the edges incident to u is different from the sum of colors taken on the edges incident to v. By ndiΣ(G), we denote the smallest value k in such a coloring of G. In this paper, we obtain that (1) ndiΣ(G) ≤ max {2Δ(G) + 1, 25} if G is a planar graph, (2) ndiΣ(G) ≤ max {2Δ(G), 19} if G is a graph such that mad(G) ≤ 5.Keywords
This publication has 13 references indexed in Scilit:
- Vertex-coloring edge-weightings: Towards the 1-2-3-conjectureJournal of Combinatorial Theory, Series B, 2010
- Degree constrained subgraphsDiscrete Applied Mathematics, 2008
- Vertex-Colouring Edge-WeightingsCombinatorica, 2007
- Adjacent Vertex Distinguishing Edge‐ColoringsSIAM Journal on Discrete Mathematics, 2007
- r-Strong edge colorings of graphsDiscrete Mathematics, 2006
- On the Neighbour-Distinguishing Index of a GraphGraphs and Combinatorics, 2006
- is a bound on the adjacent vertex distinguishing edge chromatic numberJournal of Combinatorial Theory, Series B, 2005
- Edge weights and vertex coloursJournal of Combinatorial Theory, Series B, 2004
- Coloring the square of a planar graphJournal of Graph Theory, 2002
- Graph Theory with Applications1976