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

doi:10.1016/j.ejc.2021.103489

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

Publikation: Beitrag in einer Fachzeitschrift › Diskussion › Begutachtung

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

Originalsprache	englisch
Aufsatznummer	103489
Fachzeitschrift	European Journal of Combinatorics
Jahrgang	101
DOIs	https://doi.org/10.1016/j.ejc.2021.103489
Publikationsstatus	Veröffentlicht - März 2022

ASJC Scopus subject areas

Diskrete Mathematik und Kombinatorik

Zugriff auf Dokument

10.1016/j.ejc.2021.103489

Andere Dateien und Links

Verknüpfung zur Publikation in Scopus

Fingerprint

Untersuchen Sie die Forschungsthemen von „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))“. Zusammen bilden sie einen einzigartigen Fingerprint.

Dieses zitieren

Lehner, F., Pilśniak, M., & Stawiski, M. (2022). 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)). European Journal of Combinatorics, 101, Artikel 103489. https://doi.org/10.1016/j.ejc.2021.103489

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)). / Lehner, Florian; Pilśniak, Monika; Stawiski, Marcin.
in: European Journal of Combinatorics, Jahrgang 101, 103489, 03.2022.

Publikation: Beitrag in einer Fachzeitschrift › Diskussion › Begutachtung

Lehner, F, Pilśniak, M & Stawiski, M 2022, '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))', European Journal of Combinatorics, Jg. 101, 103489. https://doi.org/10.1016/j.ejc.2021.103489

@article{995d7307cb9944c597d6be12d10f86cf,

title = "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))",

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",

author = "Florian Lehner and Monika Pil{\'s}niak and Marcin Stawiski",

note = "Publisher Copyright: {\textcopyright} 2021 Elsevier Ltd",

year = "2022",

month = mar,

doi = "10.1016/j.ejc.2021.103489",

language = "English",

volume = "101",

journal = "European Journal of Combinatorics",

issn = "0195-6698",

publisher = "Elsevier B.V.",

}

TY - JOUR

T1 - Corrigendum to “A bound for the distinguishing index of regular graphs”

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

AU - Lehner, Florian

AU - Pilśniak, Monika

AU - Stawiski, Marcin

PY - 2022/3

Y1 - 2022/3

N2 - 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

AB - 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

UR - http://www.scopus.com/inward/record.url?scp=85119932901&partnerID=8YFLogxK

U2 - 10.1016/j.ejc.2021.103489

DO - 10.1016/j.ejc.2021.103489

M3 - Comment/debate

AN - SCOPUS:85119932901

SN - 0195-6698

VL - 101

JO - European Journal of Combinatorics

JF - European Journal of Combinatorics

M1 - 103489

ER -