• Tidak ada hasil yang ditemukan

ON THE SUPER EDGE-MAGIC DEFICIENCY AND Α -VALUATIONS OF GRAPHS | Ichishima | Journal of the Indonesian Mathematical Society 19 72 1 PB

N/A
N/A
Protected

Academic year: 2017

Membagikan "ON THE SUPER EDGE-MAGIC DEFICIENCY AND Α -VALUATIONS OF GRAPHS | Ichishima | Journal of the Indonesian Mathematical Society 19 72 1 PB"

Copied!
1
0
0

Teks penuh

(1)

J. Indones. Math. Soc.

Special Edition (2011), pp. 59–69.

ON THE SUPER EDGE-MAGIC DEFICIENCY AND

α

-VALUATIONS OF GRAPHS

Rikio Ichishima

1

and Akito Oshima

2

11

College of Humanities and Sciences, Nihon University, 3-25-40

Sakurajousui Setagaya-ku, Tokyo 156-8550, Japan,

[email protected]

Department of Mathematical Information Science, Faculty of Science, Tokyo

University of Science, 1-3 Kagurazaka Shinjuku-ku, Tokyo 162-8601, Japan,

akito [email protected]

Abstract.A graphGis called super edge-magic if there exists a bijective function

f :V(G)∪E(G)→ {1,2, . . . ,|V(G)|+|E(G)|}such thatf(u) +f(v) +f(uv) is a constant for eachuv∈ E(G) andf(V(G)) ={1,2, . . . ,|V(G)|}. The super edge-magic deficiency,µs(G), of a graphGis defined as the smallest nonnegative integernwith the property that the graphG∪nK1 is super edge-magic or +∞if there exists no such integern. In this paper, we prove that ifGis a graph without isolated vertices that has anα-valuation, thenµs(G)≤ |E(G)| − |V (G)|+ 1. This leads toµs(G) =|E(G)| − |V(G)|+ 1 ifGhas the additional property thatGis not sequential. Also, we provide necessary and sufficient conditions for the disjoint union of isomorphic complete bipartite graphs to have anα-valuation. Moreover, we present several results on the super edge-magic deficiency of the same class of graphs. Based on these, we propose some open problems and a new conjecture.

Key words: Super edge-magic labeling, super edge-magic deficiency, sequential la-beling, sequential number,α-valuation.

Referensi

Dokumen terkait

In this paper, we study the Ramsey numbers for disjoint union of stars versus small cycle and small wheel.. The results are presented in the next

In addition, we extend the no- tion of vertex magic graphs by providing measures describing how close a non-vertex magic graph is to being vertex magic. The general viewpoint is

THE GOODNESS OF LONG PATH WITH RESPECT TO MULTIPLE COPIES OF COMPLETE GRAPHS.. I

Foster started collecting specimens of small cubic sym- metric graphs prior to 1934, maintaining a census of all such graphs.. In 1988 the then current version of the census

Further we obtain the CD -energy of line graphs of certain regular graphs and thus constructs pairs of CD -equienergetic graphs of same order and having different CD -eigenvalues..

MAIN RESULTS In this section, we determine the total edge and vertex irregularity strength of some graphs obtained from star, which are gear, fungus, and some copies of star.. Those

To investigate the nicely 2-distance-balanced property of the Cartesian prod- uct of graphs, we observe that using this kind of graph product with N2DB graphs cannot be generated a

Moreover, we determine a familyPσH of subsets of a hypergroupH and we give sufficient conditions such that the geometric space H, PσH is strongly transitive and the relationδnis