[PDF] Top 20 DISTANCE MAGIC GRAPHS - A SURVEY | Arumugam | Journal of the Indonesian Mathematical Society 15 363 1 PB

... For a given class of graphs Γ(n, r, . . . ), find all values of parameters (n, r, ...which a graph G ∈ Γ allows distance magic labeling f ...were the number ... Lihat dokumen lengkap

... terminology of this paper will generally follow closely that of ...All graphs considered here are finite, simple and undirected. The vertex set of a graph G is denoted by V (G), ... Lihat dokumen lengkap

... is a regular graph of order nr/2 and of degree (nr/2) ...v of L(G) there exists a third vertex w which is not adjacent to either u or v in L(G), by Lemma ...(4), the ... Lihat dokumen lengkap

... for the disjoint union of isomorphic complete bipartite graphs to have an ...on the super edge-magic deficiency of the same class of ...and a new ... Lihat dokumen lengkap

... Abstract. A labelling is a mapping whose domain is some set of graph elements — the set of vertices, for example, or the set of all vertices and edges — and whose range is ... Lihat dokumen lengkap

... Abstract. A labelling is a mapping whose domain is some set of graph elements — the set of vertices, for example, or the set of all vertices and edges — and whose range is ... Lihat dokumen lengkap

... classification of cubic symmetric graphs of different orders is given in many ...specimens of small cubic sym- metric graphs prior to 1934, maintaining a census of all ... Lihat dokumen lengkap

... type of graph labeling problem involves labeling the vertices of a graph G and then computing a value g(v) for each v ∈ V (G), where g(v) is determined by the labels on some set ... Lihat dokumen lengkap

... exists a bijection f : V (G) → [n] such that the weight of all open neighborhoods is the same, the graph is said to be 1-vertex magic, or Σ la- ...generalize the ... Lihat dokumen lengkap

... Graceful graphs were first studied by Rosa in 1966. The Kotzig-Ringel graceful tree conjecture states that every tree has a graceful ...trees of order up to 35 are ...labelings of ... Lihat dokumen lengkap

... is the open neighborhood of v. The constant k is called the magic constant of the labeling ...admits a distance magic labeling is called a ... Lihat dokumen lengkap

... that the above definitions are from the strongest to weakest in the sense that every α-valuation is also a β-valuation, every β-valuation is also a σ- valuation, and every σ-valuation ... Lihat dokumen lengkap

... derive the equations of the mathematical model, we assumed that dengue viruses are virulent, and no other microorganism that attack the ...cells of reticuloendothelial origin ... Lihat dokumen lengkap

... reduce the masking effect. Recently, the most popular approach, is a robust approach that uses a crite- ria which minimize the determinant of covariance matrix, this is well ... Lihat dokumen lengkap

... consider the relation η. Similar to the proof of Theorem ...is a congruence relation, it is enough to show that R is a right congruence relation and L is a left congruence ... Lihat dokumen lengkap

... negative. The least eigenvalue is always equal to zero. The second largest eigenvalue is called the algebraic connectivity of ...G. The basic properties including various up- per and ... Lihat dokumen lengkap

... as a generalization of a stochastic process which we call an integrated Poisson process in this ...paper. The expected value of the integrated Poisson process has been discussed ... Lihat dokumen lengkap

... pair of set of vertices and edges, where edges are unordered pair of ...be a (p, q) graph if |V | = p and |E| = q. A graph is simple if it has neither self loop nor multiple ...edges. ... Lihat dokumen lengkap

... L(G) of a graph G is a graph such that the vertices of L(G) are the edges of G and two vertices of L(G) are adjacent if and only if their cor- responding edges in G ... Lihat dokumen lengkap

... labeling of a digraph D with p vertices and q arcs is a bijection f from the set of all arcs to the set of positive integers {1, 2, 3, ...all the p oriented ... Lihat dokumen lengkap