• 1-800-526-8630U.S. (TOLL FREE)
  • 1-917-300-0470EAST COAST U.S.
  • +353-1-416-8900REST OF WORLD

This product is currently not available for purchase.


Total labeling of some families of trees and cycles with chords. Edition No. 1

  • ID: 1901292
  • September 2010
  • 76 Pages
  • VDM Publishing House

A labeling (or valuation) of a graph is a map that carries the graph elements to numbers (usually to the positive integers). The domain will usually be the set of all vertices and edges; such labelings are called total labelings. In the case when all vertices receive smallest labels, then edge-magic total (vertex-magic total) labeling is called super edge- magic total labeling (super vertex-magic total labeling). Some labelings use the vertex set or the edge set alone and they will be referred as vertex- labeling and edge-labeling respectively. Other domains are also possible. There are many types of labelings for example harmonious, cordial, graceful and antimagic. This book studies about the construction of a super edge-magic total la-beling of banana tree as well as for disjoint union of k identical copies of banana trees. We also construct the antimagic total labelings of Harary graphs

Note: Product cover images may vary from those shown

Muhammad, Hussain.
My name is Muhammad Hussain. I have completed my Ph.D from "Abdus Salam School of Mathematical Sciences, GC University, Lahore, Pakistan" under the Supervision of Dr. Edy Tri Baskoro. Currently, I am working as a Assistant Professor of Mathematics at COMSATS Institute of Information Technology, Lahore, Pakistan.

Note: Product cover images may vary from those shown
Note: Product cover images may vary from those shown

Our Clients

The City College of New York Luther College University of Copenhagen SAS Institute Inc. AbbVie Ltd. Karagozian & Case, Inc.