J.A. Gallian, A dynamic survey of graph labeling, Electron. J. Combin. #DS6. 29 Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
On Pseudo Vertex-Magic and Edge-Magic Total-Labellings - Wood (2001) (Correct)
....of cases these bounds are within a constant factor. 1 Introduction To date the study of graph labellings has focused on nding classes of graphs which admit a particular type of labelling, the more well known including graceful, harmonious and various types of magic labellings (see Gallian [18]) In this paper we relax the de nition of the well known edge magic and vertex magic labelling schemes so that every graph admits such a labelling. Our aim is to then minimise the magic number associated with such a labelling. We consider simple connected nite graphs G = V; E) with n = jV j ....
J. A. Gallian, A dynamic survey of graph labeling. Electron. J. Combin., #DS6, 2000.
On Vertex-Magic and Edge-Magic Total Injections - Wood (2002) (Correct)
....26:49 63, 2002. c Combinatorial Mathematics Society of Australasia Research completed at The University of Sydney (Sydney, Australia) and while visiting the McGill University (Montr eal, Canada) E mail: davidw scs.carleton.ca. various types of magic labellings (see the survey by Gallian [13]) In this paper we relax the de nition of the well known edge magic and vertex magic labelling schemes by allowing arbitrary positive integer labels. Since every graph admits such a labelling, our aim is to minimise the maximum label or the associated magic constant. All graphs G = V; E) are ....
....is vertexmagic if all vertex sums are some constant and vertex antimagic if all vertex sums are distinct. The constant associated with an edge magic or vertex magic injection is called the magic constant. For results in magic and antimagic vertex and edge labellings see the survey by Gallian [13]. Edge magic [5, 7, 14, 21, 23, 24, 29, 31, 32, 34, 38, 39] and vertex magic [1, 2, 15, 16, 25, 26, 28, 35] total labellings have been studied extensively; see the recent monograph by Wallis [37] A total injection which is both vertex magic and edge magic (possibly with di erent magic constants) ....
J. A. Gallian, A dynamic survey of graph labeling. Electron. J. Combin., #DS6, 2000.
On Pseudo Vertex-Magic and Edge-Magic Total-Labellings - Wood (2001) (Correct)
....of cases these bounds are within a constant factor. 1 Introduction To date the study of graph labellings has focused on nding classes of graphs which admit a particular type of labelling, the more well known including graceful, harmonious and various types of magic labellings (see Gallian [9]) In this paper we relax the de nition of the wellknown edge magic and vertex magic labelling schemes so that every graph admits such a labelling. Our aim is to then minimise the magic number associated with such a labelling. We consider simple connected nite graphs G = V; E) with n = jV j ....
J. A. Gallian, A dynamic survey of graph labeling. Electron. J. Combin., #DS6, 2000.
Some Open Problems in Combinatorics - Pikhurko (1999) (Correct)
....f(x) f(y) mod q) the resulting label are distinct. When G ia tree the de nition is slightly di erent: exactly one label may be used on two vertices. Conjecture 4 (Graham Sloane) Every tree is harmonious. Quite comprehensive survey of result on di erent labellings is presented by Gallain [14]. 7 Ramsey Theory Problem 3 For what values of r it is true that whenever we r color N some color class would necessarily contain three numbers x; y; z such that x 2 y 2 = z 2 . Not known even for r = 2. Problem 4 (Sum and Product) Is it true that whenever we r color N one of color ....
J. A. Gallian. A dynamic survey of graph labeling. Electronic J. Comb., 5(#DS6):43pp., 1997.
Graceful and Harmonious Labellings of Trees - Aldred, McKay (3 citations) (Correct)
....which are isomorphic to a given tree with n edges. In the same paper, Rosa showed that several families of trees are graceful and also that all trees on at most 16 vertices are graceful. Since this paper many papers have been written about graceful graphs and in particular graceful trees (see [1] [2]) but, apart from several more families, there has been no advance from 16 on Aldred and McKay the maximum order for which all trees are known to be graceful. In this note we describe a computer search by which we have been able to establish the following result. Theorem 1. All trees on at most ....
J. A. Gallian, A dynamic survey of graph labeling, submitted.
Θ-Graceful Labelings of Partial Cubes - Bresar, Klavzar (Correct)
No context found.
J.A. Gallian, A dynamic survey of graph labeling, Electron. J. Combin. #DS6. 29
Θ-Graceful Labelings of Partial Cubes - Bresar, Klavzar (Correct)
No context found.
J.A. Gallian, A dynamic survey of graph labeling, Electron. J. Combin., DS6, 139 pp (version October 13, 2003).
Towards the Graceful Tree Conjecture: A Survey - Alfalayleh, Brankovic.. (Correct)
No context found.
J. A. Gallian, \A Dynamic Survey of Graph Labeling", Electronic Journal of Combinatorics, DS6, (October 2003).
Graceful Graphs and Graceful Labelings: Two Mathematical.. - Redl (2003) (Correct)
No context found.
Gallian, J. A. A Dynamic Survey of Graph Labeling, The Electronic Journal of Combinatorics 1-95.
Symmetry Breaking in Graceful Graphs - Petrie, Smith (2003) (Correct)
No context found.
J. A. Gallian. A Dynamic Survey of Graph Labeling. The Electronic Journal of Combinatorics, (DS6), 2002. http://www.combinatorics.org/Surveys.
Relaxed Graceful Labellings of Trees - Van Bussel (2002) (2 citations) (Correct)
No context found.
J.A. Gallian. A dynamic survey of graph labeling. Electronic Journal of Combinatorics. Dynamic Surveys, DS6, 95 pages (December 6, 2001).
Symmetry Breaking in Graceful Graphs - Petrie, Smith (2003) (Correct)
No context found.
J. A. Gallian. A Dynamic Survey of Graph Labeling. The Electronic Journal of Combinatorics, (DS6), 2002. http://www.combinatorics.org/Surveys.
Relaxed Graceful Labellings of Trees - Van Bussel (2002) (2 citations) (Correct)
No context found.
J.A. Gallian. A dynamic survey of graph labeling. Electronic Journal of Combinatorics. Dynamic Surveys, DS6, 95 pages (December 6, 2001).
Towards the Graceful Tree Conjecture: A Survey - Alfalayleh, Brankovic.. (Correct)
No context found.
J. A. Gallian, "A Dynamic Survey of Graph Labeling", Electronic Journal of Combinatorics, DS6, (October 2003).
Connections - Magic Squares, Cubes and Matchings - Trenkler (2001) (Correct)
No context found.
J.A.Gallian, A dynamic survey of graph labeling, Electronical J.Combinatorics #2000#, #DS6.
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