Fr. 64.00

On design of magic-total labeling - On design of magic-total labeling

English, German · Paperback / Softback

Shipping usually within 2 to 3 weeks (title will be printed to order)

Description

Read more

In this book we have combined the ideas about the graphs and the labelings of the graphs. We have discussed the size of graph, order of graph, degree of vertex, kinds of vertex, kinds of edge, kinds of graph and some operations on graphs. The main focus of the book is about the labelings of the graphs. We have defined vertex labeling, edge labeling and total labeling. The ideas of magic labeling are distinguished with respect to edge magic total labeling, vertex magic total labeling and super edge magic total labeling. Moreover, the basic concepts of magic labeling and duality are also discussed. In the end of this book we have introduced the concept of w-graph and w-tree. We also have formulated the super edge magic total labelings of w-tree as well as for disjoint unions of isomorphic and non isomorphic copies of w-trees.

About the author










My Name is Muhammad Javaid. I have completed my M.S, in the field of Mathematics from GCU, Lahore, Pakistan, under the supervision of Dr. K. H. Dar, in 2008. My area of interest is Graph Labelings. Currently, I am Ph. D student in FAST National University of Computer and Emerging Sciences, Lahore Pakistan.

Product details

Authors Muhamma Javaid, Muhammad Javaid, Muhammad Hussain, Dr Muhammad Hussain
Publisher LAP Lambert Academic Publishing
 
Languages English, German
Product format Paperback / Softback
Released 01.01.2010
 
EAN 9783843350822
ISBN 978-3-8433-5082-2
No. of pages 60
Subject Natural sciences, medicine, IT, technology > Mathematics > Arithmetic, algebra

Customer reviews

No reviews have been written for this item yet. Write the first review and be helpful to other users when they decide on a purchase.

Write a review

Thumbs up or thumbs down? Write your own review.

For messages to CeDe.ch please use the contact form.

The input fields marked * are obligatory

By submitting this form you agree to our data privacy statement.