Distant sum distinguishing index of graphs
From MaRDI portal
Publication:2012525
DOI10.1016/j.disc.2017.05.009zbMath1367.05057arXiv1703.03712OpenAlexW2595589566MaRDI QIDQ2012525
Publication date: 1 August 2017
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1703.03712
adjacent strong chromatic indexneighbour sum distinguishing indexdistant set distinguishing indexdistant sum distinguishing index
Related Items (2)
On generalized neighbor sum distinguishing index of planar graphs ⋮ Distant sum distinguishing index of graphs with bounded minimum degree
Cites Work
- Adjacent vertex-distinguishing edge coloring of graphs with maximum degree \(\Delta\)
- Neighbor sum distinguishing index
- Distant irregularity strength of graphs
- Neighbor sum distinguishing index of planar graphs
- \(r\)-strong edge colorings of graphs
- Vertex-coloring edge-weightings: towards the 1-2-3-conjecture
- Adjacent vertex distinguishing edge-colorings of graphs with smaller maximum average degree
- On vertex-coloring 13-edge-weighting
- Irregularity strength of regular graphs
- Adjacent strong edge coloring of graphs
- Distant set distinguishing edge colourings of graphs
- Irregular networks, regular graphs and integer matrices with distinct row and column sums
- Edge weights and vertex colours
- The diameter of random regular graphs
- Distant irregularity strength of graphs with bounded minimum degree
- Vertex-colouring edge-weightings
- A survey on the distance-colouring of graphs
- Degree constrained subgraphs
- Neighbour-distinguishing edge colourings of random regular graphs
- \(\Delta+300\) is a bound on the adjacent vertex distinguishing edge chromatic number
- Moore graphs and beyond: a survey of the degree/diameter problem
- Neighbor sum distinguishing edge colorings of graphs with bounded maximum average degree
- Neighbor Distinguishing Edge Colorings via the Combinatorial Nullstellensatz
- How to Define an Irregular Graph
- A New Upper Bound for the Irregularity Strength of Graphs
- Asymptotically optimal neighbour sum distinguishing colourings of graphs
- Neighbor Distinguishing Edge Colorings Via the Combinatorial Nullstellensatz Revisited
- Irregular Assignments of Trees and Forests
- On the irregularity strength of them ×n grid
- On the irregularity strength of trees
- A Tight Bound on the Irregularity Strength of Graphs
- On graph irregularity strength
- On the Neighbor Sum Distinguishing Index of Planar Graphs
- On the Irregularity Strength of Dense Graphs
- Linear Bound on the Irregularity Strength and the Total Vertex Irregularity Strength of Graphs
- Adjacent Vertex Distinguishing Edge‐Colorings
- On Neighbor-Distinguishing Index of Planar Graphs
- Irregularity strength of dense graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Distant sum distinguishing index of graphs
