Neighbor sum distinguishing index of planar graphs
Authors:
- Guanghui WangGWGuanghui Wang
- Zhumin ChenZCZhumin Chen
- Jihui WangJWJihui Wang
- 1 November 2014
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 334, 70-73
Abstract
No abstract availableFunding Information
- National Natural Science Foundation of China (11101243, 61103151)
- Scientific Research Foundation for the Excellent Middle-Aged and Young Scientists of Shandong Province (BS2012SF016, BS2012DX017)
- Independent Innovation Foundation of Shandong University (IFYT 14012)
This publication has 21 references indexed in Scilit:
- Neighbor sum distinguishing edge colorings of graphs with bounded maximum average degreeDiscrete Applied Mathematics, 2014
- An improved bound on acyclic chromatic index of planar graphsDiscrete Mathematics, 2013
- NEIGHBOR SUM DISTINGUISHING COLORING OF SOME GRAPHSDiscrete Mathematics, Algorithms and Applications, 2012
- Weighted-1-antimagic graphs of prime power orderDiscrete Mathematics, 2012
- Neighbor Sum Distinguishing IndexGraphs and Combinatorics, 2012
- Adjacent vertex distinguishing edge-colorings of planar graphs with girth at least sixDiscussiones Mathematicae Graph Theory, 2011
- 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