Distant sum distinguishing index of graphs with bounded minimum degree

DOI10.26493/1855-3974.1496.623zbMath1435.05084arXiv1703.04815OpenAlexW2595178138MaRDI QIDQ5217057

Jakub Przybyło

Publication date: 21 February 2020

Published in: Ars Mathematica Contemporanea (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1703.04815

zbMATH Keywords

adjacent strong chromatic indexneighbour sum distinguishing indexdistant set distinguishing indexdistant sum distinguishing index of a graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Vertex degrees (05C07)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Neighbor sum distinguishing index
• Distant irregularity strength of graphs
• Neighbor sum distinguishing index of planar graphs
• Colouring graphs when the number of colours is almost the maximum degree
• Vertex-coloring edge-weightings: towards the 1-2-3-conjecture
• Irregularity strength of regular graphs
• A note on asymptotically optimal neighbour sum distinguishing colourings
• Irregular networks, regular graphs and integer matrices with distinct row and column sums
• Edge weights and vertex colours
• Distant sum distinguishing index of 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
• 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
• Irregularity strength of dense graphs

This page was built for publication: Distant sum distinguishing index of graphs with bounded minimum degree