M. Ba ca, M. Miller, and Slamin, Every generalized Petersen graph has a vertex-magic total labeling. In [11], pp. 1-6. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
On Pseudo Vertex-Magic and Edge-Magic Total-Labellings - Wood (2001) (Correct)
....are restricted to be consecutive positive integers. A graph admitting an edge magic (vertex magic) totallabelling is called edge magic (vertex magic) Numerous classes of graphs have been identi ed as been edge magic or not edge magic [13, 20, 28, 35, 58] and vertex magic or not vertex magic [5, 6]. The following results are known about edge magic total labellings. The n vertex complete graph Kn is edge magic i n 2 f1; 2; 6g [29] see also [12] The complete bipartite graph K a;b is edge magic [28] The n vertex cycle Cn is edge magic [28] see also [20] All ....
.... Every graph can be embedded in a connected super edge magic graph as an induced subgraph [14] The following results are known about vertex magic total labellings (also see [37 39, 50] Every generalised Petersen graph P (n; m) n 3; 1 m b 2 (n 1)c has a vertex magic total labelling [5]. Antimagic Labellings: There are important relationships between magic total labellings and so called antimagic labellings, which are described in Section 2.3 and Section 2.2. A vertex labelling of a graph G = V; E) is pseudo edge antimagic if for all distinct edges vw; xy 2 E, v) w) ....
M. Ba ca, M. Miller, and Slamin, Every generalized Petersen graph has a vertex-magic total labeling. In [11], pp. 1-6.
On Vertex-Magic and Edge-Magic Total Injections - Wood (2002) (Correct)
....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) is totally magic. Totally magic injections have been studied by McSorley [27] and totally magic labellings ....
M. Ba ca, M. Miller, and Slamin, Every generalized Petersen graph has a vertex-magic total labeling. In [4], pp. 1-6.
On Pseudo Vertex-Magic and Edge-Magic Total-Labellings - Wood (2001) (Correct)
....are restricted to be consecutive positive integers. A graph admitting an edge magic (vertex magic) total labelling is called edge magic (vertex magic) Numerous classes of graphs have been identi ed as been edge magic or not edge magic [6, 10, 13, 15, 20] and vertex magic or not vertex magic [1, 2]. The following results are known about edge magic total labellings. The n vertex complete graph Kn is edge magic i n 2 f1; 2; 6g [14] see also [5] The complete bipartite graph K a;b is edge magic [13] The n vertex cycle Cn is edge magic [13] see also [10] All ....
....super edge magic. Every graph can be embedded in a connected super edge magic graph as an induced subgraph [7] The following results are known about vertex magic total labellings. Every generalised Petersen graph P (n; m) n 3; 1 m b 1 2 (n 1)c has a vertex magic total labelling [1]. Antimagic Labellings: There are important relationships between magic total labellings and so called antimagic labellings, which are described in Section 2.3 and Section 2.2. A vertex labelling of a graph G = V; E) is pseudo edge antimagic if for all distinct edges vw; xy 2 E, v) w) ....
M. Ba ca, M. Miller, and Slamin, Every generalized Petersen graph has a vertexmagic total labeling. In [4], pp. 1-6.
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