Sum index, difference index and exclusive sum number of graphs

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

Full description

Bibliographic Details
Main Author: Haslegrave, J
Format: Journal article
Language:English
Published: Springer 2023
_version_ 1826309674231660544
author Haslegrave, J
author_facet Haslegrave, J
author_sort Haslegrave, J
collection OXFORD
description 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.
first_indexed 2024-03-07T07:39:16Z
format Journal article
id oxford-uuid:5c72df79-cab4-46f1-9137-a391b6587135
institution University of Oxford
language English
last_indexed 2024-03-07T07:39:16Z
publishDate 2023
publisher Springer
record_format dspace
spelling oxford-uuid:5c72df79-cab4-46f1-9137-a391b65871352023-04-06T08:59:24ZSum index, difference index and exclusive sum number of graphsJournal articlehttp://purl.org/coar/resource_type/c_dcae04bcuuid:5c72df79-cab4-46f1-9137-a391b6587135EnglishSymplectic ElementsSpringer2023Haslegrave, JWe 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.
spellingShingle Haslegrave, J
Sum index, difference index and exclusive sum number of graphs
title Sum index, difference index and exclusive sum number of graphs
title_full Sum index, difference index and exclusive sum number of graphs
title_fullStr Sum index, difference index and exclusive sum number of graphs
title_full_unstemmed Sum index, difference index and exclusive sum number of graphs
title_short Sum index, difference index and exclusive sum number of graphs
title_sort sum index difference index and exclusive sum number of graphs
work_keys_str_mv AT haslegravej sumindexdifferenceindexandexclusivesumnumberofgraphs