Name: Study of All Powers of Paths and Cycles Towards Domination (en Inglés)
SKU: 57444570
Price: 1448.54 MXN
Availability: InStock
Author: Sudhakaraiah, Dr Anupalli ; Sivaiah, Dr Tata
ISBN: 9786200630575

portada Study of All Powers of Paths and Cycles Towards Domination (en Inglés)

Study of All Powers of Paths and Cycles Towards Domination (en Inglés)

Formato

Libro Físico

Autor

Dr Anupalli Sudhakaraiah

Dr Tata Sivaiah

Editorial

Globeedit

Idioma

Inglés

N° páginas

168

Encuadernación

Tapa Blanda

Dimensiones

22.9x15.2x1 cm

Peso

0.25 kg.

ISBN13

9786200630575

Categorías

Matemáticas

Study of All Powers of Paths and Cycles Towards Domination (en Inglés)

Dr Anupalli Sudhakaraiah (Autor) · Dr Tata Sivaiah (Autor) · Globeedit · Tapa Blanda

Libro Nuevo Importado

Envío: 22 a 27 días háb.

$ 2,633.71$ 1,448.54

-45%

Costos de importación incluídos en el precio ✅

Libro Nuevo

Quedan 10 unidades

$ 1,448.54

¡Envío Gratis! Llega entre el 16 Oct y el 26 Oct a CUAUHTÉMOC, Ciudad de México. Seleccionar ubicación

Agregar a lista de deseos

Reseña del libro "Study of All Powers of Paths and Cycles Towards Domination (en Inglés)"

Several researchers for over 25 years are drawn towards the interval graphs. Extensive studies and the consequent revelations underlined their practical relevance to a number of real time modeling problems. Their presence is steadily enhancing in the literature pertaining to interval graphs and at times they claim to be the most studied categories of graphs. This could be partly due to the fact that interval graphs are being utilized in a number of applications related to different areas such as biology, archaeology, psychology, genetics, traffic control, database, artificial intelligence, computer scheduling, retrieval of storage information and electronic circuit design etc. In addition, interval graphs are reputed among the community of graph theory due to the vast range of properties arising out of their simple structure. we find the formulas to find domination number, chromatic number and total domination number of all powers of cycles using a circular-arc graph G. And we find algorithms to find domination number and total domination number of all powers of cycles using a circular-arc graph G