An improved upper bound for the neighbor sum distinguishing index of graphs

DOI10.1016/J.DAM.2014.05.013zbMath1297.05093OpenAlexW2075663003MaRDI QIDQ401154

Gui Ying Yan, Guang-Hui Wang

Publication date: 26 August 2014

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2014.05.013

zbMATH Keywords

neighbor sum distinguishing indexneighbor distinguishing index

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Connectivity (05C40)

Related Items (22)

Neighbor sum distinguishing total coloring of graphs embedded in surfaces of nonnegative Euler characteristic ⋮ The adjacent vertex distinguishing edge choosability of planar graphs with maximum degree at least 11 ⋮ Neighbor sum distinguishing index of \(K_4\)-minor free graphs ⋮ A proper total coloring distinguishing adjacent vertices by sums of planar graphs without intersecting triangles ⋮ Neighbor sum distinguishing edge colorings of graphs with bounded maximum average degree ⋮ Injective coloring of some graph operations ⋮ The neighbour sum distinguishing relaxed edge colouring ⋮ Neighbor sum distinguishing total choosability of planar graphs without adjacent special 5-cycles ⋮ Improved bounds for neighbor sum (set) distinguishing choosability of planar graphs ⋮ Neighbor-sum-distinguishing edge choosability of subcubic graphs ⋮ Neighbor sum distinguishing index of planar graphs ⋮ List neighbor sum distinguishing edge coloring of subcubic graphs ⋮ Neighbour sum distinguishing edge-weightings with local constraints ⋮ Neighbor sum distinguishing index of sparse graphs ⋮ On the neighbour sum distinguishing index of graphs with bounded maximum average degree ⋮ Neighbor sum distinguishing chromatic index of sparse graphs via the combinatorial Nullstellensatz ⋮ Adjacent vertex distinguishing colorings by sum of sparse graphs ⋮ The adjacent vertex distinguishing total coloring of planar graphs without adjacent 4-cycles ⋮ Neighbor sum distinguishing colorings of graphs with maximum average degree less than \(\frac{37} {12}\) ⋮ Neighbor sum distinguishing edge coloring of subcubic graphs ⋮ Neighbor sum distinguishing index of subcubic graphs ⋮ On the Neighbor Sum Distinguishing Index of Planar Graphs

Cites Work

• Neighbor sum distinguishing index
• Adjacent vertex-distinguishing edge colorings of \(K_{4}\)-minor free graphs
• On the neighbour-distinguishing index of a graph
• \(r\)-strong edge colorings of graphs
• Adjacent vertex distinguishing edge-colorings of graphs with smaller maximum average degree
• Adjacent strong edge coloring of graphs
• \(\Delta+300\) is a bound on the adjacent vertex distinguishing edge chromatic number
• Neighbor sum distinguishing edge colorings of graphs with bounded maximum average degree
• Adjacent vertex distinguishing edge-colorings of planar graphs with girth at least six
• NEIGHBOR SUM DISTINGUISHING COLORING OF SOME GRAPHS
• Adjacent Vertex Distinguishing Edge‐Colorings
• Unnamed Item

This page was built for publication: An improved upper bound for the neighbor sum distinguishing index of graphs