| Alternate document: Details On Pseudo Vertex-Magic and Edge-Magic Total-Labellings (01) David R. Wood |
David R. Wood  Home/Search
Context
Related
| usyd.edu.au/~david...CSAAG200102.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: usyd.edu.au/~aag/ (more) Homepages: D.Wood |
Rate this article:      (best)Comment on this article |
Abstract: To date the study of graph labellings has focused on finding 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 end vertices is some constant (pseudo edge-magic) (Update)
Similar documents (at the sentence level):
70.5%: On Pseudo Vertex-Magic and Edge-Magic Total-Labellings - Wood (2001) (Correct)
6.8%: On Vertex-Magic and Edge-Magic Total Injections - Wood (2002) (Correct)
Active bibliography (related documents): More All
0.2: Binary B_2-Sequences: a new upper bound - Cohen, Litsyn, al. (Correct)
0.1: Parallel Block-Diagonal-Bordered Sparse Linear Solvers for Power.. - Koester (1994) (Correct)
0.1: Magic Carpets - Friedman, Keith (2000) (Correct)
Similar documents based on text: More All
0.6: Balanced Labellings and Schubert Polynomials - Fomin, Greene, Reiner, Shimozono (1995) (Correct)
0.4: Geometric Thickness in a Grid of Linear Area - Wood (2001) (Correct)
0.3: Three-Dimensional Orthogonal Graph Drawing with Optimal Volume - Biedl, Thiele, Wood (2001) (Correct)
BibTeX entry: (Update)
@article{ wood-algorithmic,
author = "David R. Wood",
title = "On Pseudo Vertex-Magic and Edge-Magic Total-Labellings",
journal = "Australasian Journal of Combinatorics",
volume = "26",
pages = "49-63",
year = "2002",
url = "citeseer.ist.psu.edu/wood01pseudo.html" }
Citations (may not include all citations):15 A dynamic survey of graph labeling - Gallian - 2000
9 Theorems in the additive theory of numbers (context) - Bose, Chowla
7 Pearls in graph theory: a comprehensive introduction (context) - Hartsfield, Ringel - 1994
4 uber trigonometrische Polynome und seine Anwendung in der Th.. (context) - Sidon, Satz - 1932
3 th Australasian Workshop on Combinatorial Algorithms (context) - Brankovic, Ryan et al. - 2000
3 a question by Erd}os about edge-magic graphs (context) - Craft, Tesar - 1999
3 Clarendon Press (context) - Halberstam, Roth et al. - 1966
3 Super edge-magic graphs (context) - Enomoto, Llado et al. - 1998
3 Edge-magic total labelling on disconnected graphs (context) - Wijaya, Baskoro
3 Induced graph theorem on magic valuations (context) - Enomoto, Masuda et al. - 2000
3 Magic valuations of nite graphs (context) - Kotzig, Rosa - 1970
3 a problem of Sidon in additive number theory (context) - Erd, Tur et al. - 1941
3 Every generalized Petersen graph has a vertexmagic total lab.. (context) - Ba, Miller
3 All cycles are edge-magic (context) - Godbold, Slater - 1998
3 Well-spread sequences (context) - Phillips, Wallis - 1999
3 Another tree conjecture (context) - Ringel, Llado - 1996
3 the relations between certain graph labelings (context) - Bodendiek, Walther - 1994
3 Edge-magic total labelings (context) - Wallis, Bascoro et al.
2 the edge-magic and edge-graceful total graphs conjecture (context) - Lee, Tong et al. - 1999
1 Publications du Centre de Recherches Mathematiques Universi.. (context) - Kotzig, Rosa et al. - 1972
http://www.research.att.com/njas/sequences/
Documents on the same site (http://www.cs.usyd.edu.au/~aag/):
"Scheduled-Multicast" with Application in Multimedia Networks - El-Gindy, Nguyen, Symvonis (2000) (Correct)
Brooks' Vertex-Colouring Theorem in Linear Time - Baetz, Wood (2001) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC