Home > Research > Publications & Outputs > Sum Index, Difference Index and Exclusive Sum N...

Associated organisational unit

Links

Text available via DOI:

View graph of relations

Sum Index, Difference Index and Exclusive Sum Number of Graphs

Research output: Contribution to Journal/MagazineJournal articlepeer-review

Published

Standard

Sum Index, Difference Index and Exclusive Sum Number of Graphs. / Haslegrave, John.
In: Graphs and Combinatorics, Vol. 39, No. 2, 32, 01.04.2023.

Research output: Contribution to Journal/MagazineJournal articlepeer-review

Harvard

APA

Vancouver

Haslegrave J. Sum Index, Difference Index and Exclusive Sum Number of Graphs. Graphs and Combinatorics. 2023 Apr 1;39(2):32. Epub 2023 Mar 13. doi: 10.1007/s00373-023-02624-0

Author

Haslegrave, John. / Sum Index, Difference Index and Exclusive Sum Number of Graphs. In: Graphs and Combinatorics. 2023 ; Vol. 39, No. 2.

Bibtex

@article{83eb3affdc324870a4e5573b98b56b1d,
title = "Sum Index, Difference Index and Exclusive Sum Number of Graphs",
abstract = "We consider two recent conjectures made by Harrington, Henninger-Voss, Karhadkar, Robinson and Wong concerning relationships between the sum index, difference index and exclusive sum number of graphs. One conjecture posits an exact relationship between the first two invariants; we show that in fact the predicted value may be arbitrarily far from the truth in either direction. In the process we establish some new bounds on both the sum and difference index. The other conjecture, that the exclusive sum number can exceed the sum index by an arbitrarily large amount, follows from known, but non-constructive, results; we give an explicit construction demonstrating it. Simultaneously with the first preprint of this paper appearing, Harrington et al. updated their preprint with two counterexamples to the first conjecture; however, their counterexamples only give a discrepancy of 1, and only in one direction. They therefore modified the conjecture from an equality to an inequality; our results show that this is still false in general.",
author = "John Haslegrave",
year = "2023",
month = apr,
day = "1",
doi = "10.1007/s00373-023-02624-0",
language = "English",
volume = "39",
journal = "Graphs and Combinatorics",
issn = "0911-0119",
publisher = "Springer Japan",
number = "2",

}

RIS

TY - JOUR

T1 - Sum Index, Difference Index and Exclusive Sum Number of Graphs

AU - Haslegrave, John

PY - 2023/4/1

Y1 - 2023/4/1

N2 - We consider two recent conjectures made by Harrington, Henninger-Voss, Karhadkar, Robinson and Wong concerning relationships between the sum index, difference index and exclusive sum number of graphs. One conjecture posits an exact relationship between the first two invariants; we show that in fact the predicted value may be arbitrarily far from the truth in either direction. In the process we establish some new bounds on both the sum and difference index. The other conjecture, that the exclusive sum number can exceed the sum index by an arbitrarily large amount, follows from known, but non-constructive, results; we give an explicit construction demonstrating it. Simultaneously with the first preprint of this paper appearing, Harrington et al. updated their preprint with two counterexamples to the first conjecture; however, their counterexamples only give a discrepancy of 1, and only in one direction. They therefore modified the conjecture from an equality to an inequality; our results show that this is still false in general.

AB - We consider two recent conjectures made by Harrington, Henninger-Voss, Karhadkar, Robinson and Wong concerning relationships between the sum index, difference index and exclusive sum number of graphs. One conjecture posits an exact relationship between the first two invariants; we show that in fact the predicted value may be arbitrarily far from the truth in either direction. In the process we establish some new bounds on both the sum and difference index. The other conjecture, that the exclusive sum number can exceed the sum index by an arbitrarily large amount, follows from known, but non-constructive, results; we give an explicit construction demonstrating it. Simultaneously with the first preprint of this paper appearing, Harrington et al. updated their preprint with two counterexamples to the first conjecture; however, their counterexamples only give a discrepancy of 1, and only in one direction. They therefore modified the conjecture from an equality to an inequality; our results show that this is still false in general.

U2 - 10.1007/s00373-023-02624-0

DO - 10.1007/s00373-023-02624-0

M3 - Journal article

VL - 39

JO - Graphs and Combinatorics

JF - Graphs and Combinatorics

SN - 0911-0119

IS - 2

M1 - 32

ER -