Conference paper
The sum number of a disjoint union of graphs
14th Australasian Workshop on Combinatorial Algorithms (AWOCA) (Seoul National University, Seoul, Korea, 13/07/2003–16/07/2003)
2003
Abstract
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.
Details
- Title
- The sum number of a disjoint union of graphs
- Authors/Creators
- M. Miller (Author/Creator)J. Ryan (Author/Creator)W.F. Smyth (Author/Creator)
- Conference
- 14th Australasian Workshop on Combinatorial Algorithms (AWOCA) (Seoul National University, Seoul, Korea, 13/07/2003–16/07/2003)
- Identifiers
- 991005544854207891
- Murdoch Affiliation
- Murdoch University
- Language
- English
- Resource Type
- Conference paper
Metrics
201 File views/ downloads
156 Record Views