(a, d) Edge- Antimagic Total Labelling of Non-Planar Classes of Graphs
Journal Title: International Journal of Mathematics and Computer Applications Research (IJMCAR) - Year 2019, Vol 9, Issue 1
Abstract
The (a, d) edge- antimagic total labeling of a graph G is a bijective function ρ: V (G)∪ E(G) → {1, 2,…,p + q} such that the set of edge-weights of all edges in G, {w(xy) = ρ(x) + ρ(xy) + ρ(y) : xy ∈ E(G)}, forms an arithmetic progression {a, a+ d, a+ 2d,..., a+ (q − 1)d}, where a > 0 and d ≥ 0 are fixed integers. The planar and non-planar classes of graphs have an important place for the computation of their (a, d) edge- antimagic total labelling apart from the many applications of such labeling in computer sciences and elsewhere. The present article covers the same type of labeling of non-planar families of graphs.
Authors and Affiliations
Hafiz Usman Afzal
Keywords
Related Articles
- EP ID EP600714
- DOI 10.24247/ ijmcarjun20194
- Views 114
- Downloads 0
ARIMA and ARIMAX Stochastic Models for Fertility in Nigeria
The aim of this study to compare forecasting abilities of two time series models: Univariate autoregressive integrated moving average (ARIMA) and autoregressive integrated moving average with exogenous variable, (ARIMAX)...
Some New Exact Traveling Wave Solutions of the mKdV Equation by Khater Method
In this paper, Khater method is used to construct new analytical solutions of mKdV equation. As a result, some new types of exact traveling wave solutions are obtained using trigonometric, hyperbolic, exponential functio...
New Three-Term Conjugate Gradient Method for Solving Unconstrained Optimization Problems
In this paper we used, the Dai-Yuan nonlinear conjugate gradient (DYCG) method, to the three-term conjugate gradient (TDYCG) method and the derivation of the method, based on the Perry’s conjugacy condition .The global c...
AN EFFICIENT MODIFIED CUCKOO SEARCH OPTIMIZATION WITH THE RATIONAL BARRIER FUNCTION
Recent modern optimization algorithms are often very successful in solving NP-hard improvement problems. One of the main disadvantages of the search algorithm in cuckoo (CS) is the weakness of its ability as a local sear...
Fractional Partial Differential Equations – A Study by Numerical Methods
This paper is to prove that, the fractional partial differential equation forms a finite domain with the numerical solution by using different fractional derivatives. The two fractions are used to prove the fractional di...