Fr. 65.00

Domination and Distance k-domination stable graphs

English · Paperback / Softback

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

Description

Read more

In the first chapter of this book, we provide basic definitions and theorems which are used in the subsequent chapters. In the second chapter, we define domination polynomial, domination root and d- number of a graph. Moreover, we introduce d- stable and d-unstable graphs. Domination polynomial of some graphs and domination polynomial of square of some graphs are provided. Bounds for domination roots of some graphs are included. Examples of some d- stable and d-unstable graphs are included. Chapter 3 considers the study of distance k- domination polynomial, distance k-domination root and d k number of a graph. We have also discussed d k stable and d k unstable graphs. Chapter 4 deals with some general properties of domination and distance k domination polynomials.

About the author










Dr. Anil Kumar V. is an Associate Professor of Mathematics, Universityof Calicut, India. He earned a Ph.D in Mathematics from Universityof Kerala, India in 1997, working in area of graph theory. He remainsactive in research in graph theory.Shyama M.P. is an Assistant Professor of Mathematics, Malabar ChristianCollege, Kerala, India.

Product details

Authors Kumar V. Anil, M. P. Shyama
Publisher LAP Lambert Academic Publishing
 
Languages English
Product format Paperback / Softback
Released 19.09.2017
 
EAN 9783330346895
ISBN 978-3-33-034689-5
No. of pages 104
Subject Natural sciences, medicine, IT, technology > Mathematics

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.