Super edge-magic labeling of graphs: deficiency and maximality
A graph G of order p and size q is called super edge-magic if there exists a bijective function f from V(G) U E(G) to {1, 2, 3, ..., p+q} such that f(x) + f(xy) + f(y) is a constant for every edge $xy \in E(G)$ and f(V(G)) = {1, 2, 3, ..., p}. The super edge-magic deficiency of a graph G is either t...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | EJournal Article |
| Published: |
GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB,
2017-10-16.
|
| Subjects: | |
| Online Access: | Get Fulltext |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| LEADER | 02295 am a22002533u 4500 | ||
|---|---|---|---|
| 001 | EJGTA_367_pdf_50 | ||
| 042 | |a dc | ||
| 100 | 1 | 0 | |a Ngurah, Anak Agung Gede; Department of Civil Engineering University of Merdeka Malang Jalan Terusan Raya Di |e author |
| 100 | 1 | 0 | |e contributor |
| 700 | 1 | 0 | |a Simanjuntak, Rinovia; Combinatorial Mathematics Research Group Faculty of Mathematics and Natural Sciences Institut Teknologi Bandung Jalan Ganesa 10 Bandung, Indonesia |e author |
| 245 | 0 | 0 | |a Super edge-magic labeling of graphs: deficiency and maximality |
| 260 | |b GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB, |c 2017-10-16. | ||
| 500 | |a https://www.ejgta.org/index.php/ejgta/article/view/367 | ||
| 520 | |a A graph G of order p and size q is called super edge-magic if there exists a bijective function f from V(G) U E(G) to {1, 2, 3, ..., p+q} such that f(x) + f(xy) + f(y) is a constant for every edge $xy \in E(G)$ and f(V(G)) = {1, 2, 3, ..., p}. The super edge-magic deficiency of a graph G is either the smallest nonnegative integer n such that G U nK_1 is super edge-magic or +~ if there exists no such integer n. In this paper, we study the super edge-magic deficiency of join product graphs. We found a lower bound of the super edge-magic deficiency of join product of any connected graph with isolated vertices and a better upper bound of the super edge-magic deficiency of join product of super edge-magic graphs with isolated vertices. Also, we provide constructions of some maximal graphs, ie. super edge-magic graphs with maximal number of edges. | ||
| 540 | |a Copyright (c) 2017 Electronic Journal of Graph Theory and Applications (EJGTA) | ||
| 546 | |a eng | ||
| 690 | |a super edge-magic graph, super edge magic deficiency, join product graph, maximal graph | ||
| 655 | 7 | |a info:eu-repo/semantics/article |2 local | |
| 655 | 7 | |a info:eu-repo/semantics/publishedVersion |2 local | |
| 655 | 7 | |a Peer-reviewed Article |2 local | |
| 786 | 0 | |n Electronic Journal of Graph Theory and Applications (EJGTA); Vol 5, No 2 (2017): Electronic Journal of Graph Theory and Applications; 212-220 | |
| 786 | 0 | |n 2338-2287 | |
| 787 | 0 | |n https://www.ejgta.org/index.php/ejgta/article/view/367/pdf_50 | |
| 856 | 4 | 1 | |u https://www.ejgta.org/index.php/ejgta/article/view/367/pdf_50 |z Get Fulltext |