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

... 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

... 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

... graph of order n. Let L(G) be the line graph of G such that for any two adjacent vertices u and v of L(G), there exists a third vertex w in L(G) which is not adjacent to either u or ... 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

... Abstract. A graph G is called super edge-magic if there exists a bijective function f : V (G) ∪ E (G) → {1, 2, ...is a constant for each uv ∈ E (G) and f (V (G)) = {1, 2, ... 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

... dynamic survey [8], finding out what has been done for any particular kind of labeling and keeping up with new discoveries is difficult because of the sheer number of papers and because ... Lihat dokumen lengkap

... Since a unicyclic graph G on n vertices has n edges, it follows that if G has a graceful labeling, then exactly one of the integers from the set {0, 1, 2, · · · , n} is missing ... Lihat dokumen lengkap

... use of Theorem 3.2, we could also consider the closed neighborhood matrix N and notice that det(N ) = −16 6= ...{0, 1}-vertex ...{2}-vertex magic. The adjacency matrix for G1 is ... 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

... is the evaluation of x at time T and (x, p) is the solution of differential equation system (6)- (7) with initial conditions (x(0), p(0)) = (m, ...minimize the functional F by employing ... Lihat dokumen lengkap

... Late of 1970’s is the beginning era of research in ...application of database technique in image, held in Florence. Since then, the application of image database management ... 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

... edges. The energy E(G) of G, denoted by E(G), is defined to be the sum of the absolute values of the eigenvalues of ...energy of a graph, one in terms ... Lihat dokumen lengkap

... − 1)(χ(H ) − 1) + s(H ), (1) where G is a connected graph of order n, χ(H ) denotes the chromatic number of H and s(H ) is its chromatic surplus, namely, the ... 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

... consists of a finite nonempty set V of objects called vertices and a set E of ordered pairs of distinct ...element of E is an arc or a directed edge. If a ... 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