Name: A Study of Directed Graph and Related Computer Programming (en Inglés)
Price: 2913.00 UYU
Availability: InStock
Author: Binwal, Jitendra ; Parihar, C. L. ; Tiwari, Madhu
ISBN: 9786203580563

portada A Study of Directed Graph and Related Computer Programming (en Inglés)

A Study of Directed Graph and Related Computer Programming (en Inglés)

Formato

Libro Físico

Autor

Jitendra Binwal

C. L. Parihar

Madhu Tiwari

Editorial

LAP Lambert Academic Publishing

Idioma

Inglés

N° páginas

188

Encuadernación

Tapa Blanda

Dimensiones

22.9 x 15.2 x 1.1 cm

Peso

0.28 kg.

ISBN13

9786203580563

Categorías

Matemáticas

A Study of Directed Graph and Related Computer Programming (en Inglés)

Jitendra Binwal (Autor) · C. L. Parihar (Autor) · Madhu Tiwari (Autor) · LAP Lambert Academic Publishing · Tapa Blanda

Libro Nuevo Importado

Envío: 23 a 28 días háb.

$ 5.826$ 2.913

-50%

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

Libro Nuevo

Quedan 10 unidades

$ 2.913

Llega entre el 18 Ago y el 26 Ago a Montevideo, Montevideo. Seleccionar ubicación

Agregar a lista de deseos

Reseña del libro "A Study of Directed Graph and Related Computer Programming (en Inglés)"

The present Ph. D. Thesis has been divided into seven chapters: I-VII, which deals with introduction, review of literature, isomorphism of directed graphs by considering graph invariant that is probability propagation matrix and related computer programming in C++ language; decyclization of directed graph and its isomorphic image by using combinatorial algorithm and related computer programming in C++ language; and pebbling on directed graphs.Chapter I presents the essential preliminaries related to graph, directed graph, review of literature, history, development, and the applications of graph theory in inter-disciplinary fields.Chapter II discusses graph isomorphism of undirected plane graphs.Chapter III presents a generalized heuristic program as a certificate for testing graph isomorphism by using C++ programming.Chapter IV is devoted to the study of decyclization in directed graphs and its isomorphic image by considering combinatorial approach.Chapter V discusses some aspects of combinatorial algorithms for feedback problems in directed graphs and presents a generalized heuristic program DTCPP. Chapter VI and VII discusses pebbling on undirected graphs and directed graphs.