The sum number of a disjoint union of graphs
Miller, M., Ryan, J. and Smyth, W.F. (2003) The sum number of a disjoint union of graphs. In: 14th Australasian Workshop on Combinatorial Algorithms (AWOCA), 13 - 16 July 2003, Seoul National University, Seoul, Korea
In this paper we consider the disjoint union of graphs as sum graphs. We provide an upper bound on the sum number of a disjoint union of graphs and provide an application for the exclusive sum number of a graph. We conclude with some open problems.
|Publication Type:||Conference Paper|
|Item Control Page|
Downloads per month over past year