ISSN 1234-3099 (print version)
ISSN 2083-5892 (electronic version)
SCImago Journal Rank (SJR) 2018: 0.763
Rejection Rate (2017-2018): c. 84%
Discussiones Mathematicae Graph Theory 27(2) (2007)
Suresh Manjanath Hegde
Department of mathematical and Computational sciences
National Institute of Technology Karnataka
Surathkal, Srinivasnagar-575025, India
School of Electrical Engineering and Computer Science
University of Newcastle
Callaghan NSW 2308, Australia
In this paper, we give an upper bound for k with respect to which the
given graph may possibly be k-sequentially additive using the independence
number of the graph. Also, we prove a variety of results on k-sequentially
additive graphs, including the number of isolated vertices to be added to a
complete graph with four or more vertices to be simply sequentially additive
and a construction of an infinite family of k-sequentially additive graphs
from a given k-sequentially additive graph.
Keywords: simply (k-)sequentially additive labelings
(graphs), segregated labelings.
2000 Mathematics Subject Classification: 05C78.
Received 4 January 2006
Revised 5 February 2007 Accepted 5 February 2007