Name
Abstract | ||
|---|---|---|
Let G=(V(G),E(G)) be a finite simple graph with p=|V(G)| vertices and q=|E(G)| edges, without isolated vertices or isolated edges. A vertex magic total labeling is a bijection from V(G)∪E(G) to the consecutive integers 1,2,…,p+q, with the property that, for every vertex u in V(G), one has f(u)+∑uv∈E(G)f(uv)=k for some constant k. Such a labeling is called E-super vertex magic if f(E(G))={1,2,…,q}. A graph G is called E-super vertex magic if it admits an E-super vertex magic labeling. More recently Marimuthu and Balakrishnan (2012) studied some basic properties of such labeling and established E-super vertex magic labeling of some families of graphs. In this note we extend their results and more examples are also provided. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1016/j.dam.2014.06.009 | Discrete Applied Mathematics |
Keywords | Field | DocType |
E-super vertex magic labeling,Regular graph,Hamiltonian cycle,Circulant graph,Cayley graph | Discrete mathematics,Combinatorics,Magic star,Vertex (geometry),Bound graph,Vertex (graph theory),Cycle graph,Neighbourhood (graph theory),Degree (graph theory),Mathematics,Edge-graceful labeling | Journal |
Volume | ISSN | Citations |
178 | 0166-218X | 3 |
PageRank | References | Authors |
0.48 | 2 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Tao-Ming Wang | 1 | 59 | 12.79 |
| Guang-Hui Zhang | 2 | 3 | 1.16 |