- Title
- Vertex-magic total labeling of generalized Petersen graphs and convex polytopes
- Creator
- Miller, Mirka; Baca, Martin; MacDougall, James
- Date
- 2006
- Type
- Text; Journal article
- Identifier
- http://researchonline.federation.edu.au/vital/access/HandleResolver/1959.17/57769
- Identifier
- vital:597
- Identifier
- ISSN:0835-3026
- Abstract
- To date the study of graph labellings has focused on nding classes of graphs which admit a particular type of labelling. Here we consider variations of the well-known edge-magic and vertex-magic labellings for which all graphs admit such a labelling. In particular we consider two types of labellings of the vertices and edges of a graph with distinct positive integers: (1) for every edge the sum of its label and those of its endvertices is some constant (pseudo edge-magic); and (2) for every vertex the sum of its label and those of the edges incident to it is some constant (pseudo vertex-magic). Our aim is to minimise the constant, called the magic number, associated with the labelling. We present lower and upper bounds on the magic number in pseudo edge-magic and pseudo vertex-magic labellings of complete graphs, trees and arbitrary graphs. In a number of cases these bounds are within a constant factor.; C1
- Publisher
- Canada Charles Babbage Research Centre
- Relation
- JCMCC Journal of Combinatorial Mathematics and Combinatorial Computing Vol. 59, no. (2006), p. 89-99
- Rights
- Copyright Charles Babbage Research Centre
- Rights
- Open Access
- Rights
- This metadata is freely available under a CCO license
- Subject
- 0101 Pure Mathematics; Graph labeling
- Full Text
- Reviewed
- Hits: 670
- Visitors: 686
- Downloads: 54
| Thumbnail | File | Description | Size | Format | |||
|---|---|---|---|---|---|---|---|
| View Details Download | SOURCE1 | Accepted | 184 KB | Adobe Acrobat PDF | View Details Download |