• Cite Icon1
  • https://doi.org/10.1007/978-3-030-86593-1_16Copy DOI Icon

The Space Complexity of Sum Labelling

  • Jan 1, 2021
  • Henning Fernau +1 more
Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

A graph is called a sum graph if its vertices can be labelled by distinct positive integers such that there is an edge between two vertices if and only if the sum of their labels is the label of another vertex of the graph. Most papers on sum graphs consider combinatorial questions like the minimum number of isolated vertices that need to be added to a given graph to make it a sum graph. In this paper, we initiate the study of sum graphs from the viewpoint of computational complexity. Note that every n-vertex sum graph can be represented by a sorted list of n positive integers where edge queries can be answered in \(\mathscr {O}(\log n)\) time. Thus, limiting the size of the vertex labels upper-bounds the space complexity of storing the graph.

Similar Papers
  • Research Article

Some standard results on even sum graphs

  • Oct 01, 2020
  • Malaya Journal of Matematik
  • K Chinju Krishna +2
  • Research Article

A Theorem on Sum Graphs

  • May 01, 2003
  • Electronic Notes in Discrete Mathematics
  • G Santhosh +1
  • Research Article
  • Citations15

On the sum number of wheels

  • Mar 23, 2001
  • Discrete Mathematics
  • Martin Sutton +1
  • Research Article
  • Citations8

The integral sum number of complete bipartite graphs Kr, s

  • Aug 01, 2001
  • Discrete Mathematics
  • Wenjie He +5
  • Research Article
  • Citations51

Sum graphs over all the integers

  • Jan 01, 1994
  • Discrete Mathematics
  • Frank Harary
  • Research Article
  • Citations2

Notes on Hong's conjecture on nonsingularity of power LCM matrices

  • Jan 01, 2022
  • AIMS Mathematics
  • Guangyan Zhu +2
  • Research Article
  • Citations26

Divisibility properties of power GCD matrices and power LCM matrices

  • Oct 22, 2007
  • Linear Algebra and its Applications
  • Shaofang Hong
  • Research Article

Edge Sum Number of Jahangir Graphs

  • Jan 01, 2014
  • IOSR Journal of Mathematics
  • D S T Ramesh +2
  • Research Article
  • Citations21

A theorem on partitions

  • Nov 01, 1963
  • Journal of the Australian Mathematical Society
  • R L Graham
  • Research Article

Uniqueness conjecture on simultaneous Pell equations

  • Jan 01, 2023
  • Acta Arithmetica
  • Yasutsugu Fujita +1
  • Research Article
  • Citations1

Generation of the symmetric field by Newton polynomials in prime characteristic

  • Apr 01, 2012
  • Rocky Mountain Journal of Mathematics
  • Maurizio Monge
  • Research Article
  • Citations1

Coloring Toeplitz graphs

  • Jul 17, 2010
  • Electronic Notes in Discrete Mathematics
  • Sara Nicoloso +1
  • Research Article
  • Citations41

Any Diophantine quintuple contains a regular Diophantine quadruple

  • Jan 22, 2009
  • Journal of Number Theory
  • Yasutsugu Fujita
  • Research Article
  • Citations2

Algorithms for variable length subnet address assignment

  • Jun 01, 1998
  • IEEE Transactions on Computers
  • M.J Atallah +1
  • Book Chapter

Simultaneous Product Representations by Values of Rational Functions

  • Jan 01, 1985
  • P D T A Elliott
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.