Corrigendum to “A bound for the distinguishing index of regular graphs”: “A bound for the distinguishing index of regular graphs” (European Journal of Combinatorics (2020) 89, (103145), (S0195669820300664), (10.1016/j.ejc.2020.103145))

Florian Lehner, Monika Pilśniak, Marcin Stawiski

Research output: Contribution to journalComment/debatepeer-review

Abstract

As noted by Mariusz Grech and Andrzej Kisielewicz [1], the inequality on page 6, line 9 of [2] is only valid if [Formula presented]. Hence the case [Formula presented]. This case can be treated similarly to the cases discussed in the paper. We may assume that the unique back-edge of each vertex does not connect it to

Original languageEnglish
Article number103489
JournalEuropean Journal of Combinatorics
Volume101
DOIs
Publication statusPublished - Mar 2022

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics

Fingerprint

Dive into the research topics of 'Corrigendum to “A bound for the distinguishing index of regular graphs”: “A bound for the distinguishing index of regular graphs” (European Journal of Combinatorics (2020) 89, (103145), (S0195669820300664), (10.1016/j.ejc.2020.103145))'. Together they form a unique fingerprint.

Cite this