Solution to some open problems on E-super vertex magic labeling of disconnected graphs

Gurusamy Thevar Marimuthu and Gurunathan Kumar

Applied Mathematics and Computation, 2015, vol. 268, issue C, 657-663

Abstract: An E-super vertex magic labeling is a bijection f :V(G)UE(G)→{1,2,3,…,p+q} such that for each vertex u, f(u)+∑v∈N(u)f(uv)=k for some constant k where f(E(G))={1,2,3,…,q}. A graph that admits an E-super vertex magic labeling is called an E-super vertex magic graph. The only disconnected graphs that have been shown to be E-super vertex magic are mCn if and only if both m and n are odd. The article “Marimuthu and Balakrishnan (2012)” discussed the E-super vertex magicness of connected graphs. In this paper, we pay our attention to prove the existence and non existence of E-super vertex magic labeling for some families of disconnected graphs. Also we provide solution to some open problems found in the article “Gray and MacDougall (2009)”.

Keywords: Vertex magic total labeling; V-super vertex magic labeling; E-Super vertex magic labeling (search for similar items in EconPapers)
Date: 2015
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300315008772
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:268:y:2015:i:c:p:657-663

DOI: 10.1016/j.amc.2015.06.096

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().