Baig, Abdul Qudair (2010) Super Edge Magic Deficiency of Forests. PhD thesis, Govt. College University, Lahore .
A labeling of a graph is a mapping that carries some set of graph elements(vertices, edges or both) into numbers (usually positive integers). An edge-magic total labeling of a graph with p vertices and q edges is a one-to-one mapping that takes the vertices and edges onto the integers 1; 2; : : : ; p + q, so that the sums of the label on the edges and the labels of their end vertices are always the same, thus they are independent any particular edge. Such a labeling is called super if the p smallest possible labels appear at the vertices. In 1970 Kotzig and Rosa  introduced the concept of edge-magic de ciency of a graph G, denoted by (G), which is the minimum nonnegative integer n such that G[nK1 is edge-magic total. Motivated by Kotzig and Rosa's concept of edge-magic de ciency, Figueroa-Centeno, Ichishima and Muntaner-Batle  de ned a similar concept for super edge-magic total labelings. The super edge-magic de ciency of a graph G, which is denoted by s(G), is the minimum nonnegative integer n such that G [ nK1 has a super edge-magic total labeling or it is equal to 1 if there exists no such n. The thesis is devoted to study of super edge-magic de ciency of forests.We present new results on the super edge-magic de ciencies of forests including union of paths, stars, comb, banana trees and subdivisions of K1;3. In the thesis we also deal with the super edge-magic de ciencies of forests formed by a disjoint union of stars.
|Item Type:||Thesis (PhD)|
|Uncontrolled Keywords:||Deficiency, Mapping, Super, Elements, Equal, Forests, Edge, Smallest, Vertices|
|Subjects:||Physical Sciences (f) > Mathematics(f5)|
|Deposited By:||Mr. Javed Memon|
|Deposited On:||13 Aug 2011 09:57|
|Last Modified:||13 Aug 2011 09:57|
Repository Staff Only: item control page