Name: Pancyclic and Bipancyclic Graphs (Springerbriefs in Mathematics) (en Inglés)
SKU: 50881357
Price: 54.12 USD
Availability: InStock
Author: John C. George; Abdollah Khodkar; W.D. Wallis

portada Pancyclic and Bipancyclic Graphs (Springerbriefs in Mathematics) (en Inglés)

Pancyclic and Bipancyclic Graphs (Springerbriefs in Mathematics) (en Inglés)

Formato

Libro Físico

Editorial

Springer

Autor

John C. George; Abdollah Khodkar; W.D. Wallis

Año

2016

Idioma

Inglés

N° páginas

122

Encuadernación

Tapa Blanda

ISBN13

9783319319506

N° edición

Categorías

Combinatoria y teoría de grafos

Pancyclic and Bipancyclic Graphs (Springerbriefs in Mathematics) (en Inglés)

John C. George; Abdollah Khodkar; W.d. Wallis (Autor) · Springer · Tapa Blanda

Libro Nuevo Importado

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

$ 108.24$ 54.12

-50%

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

Libro Nuevo

Quedan más de 100 unidades

$ 54.12

Llega entre el 21 Sep y el 02 Oct a Quito, Pichincha. Seleccionar ubicación

Agregar a lista de deseos

Reseña del libro "Pancyclic and Bipancyclic Graphs (Springerbriefs in Mathematics) (en Inglés)"

This book is focused on pancyclic and bipancyclic graphs and is geared toward researchers and graduate students in graph theory. Readers should be familiar with the basic concepts of graph theory, the definitions of a graph and of a cycle. Pancyclic graphs contain cycles of all possible lengths from three up to the number of vertices in the graph. Bipartite graphs contain only cycles of even lengths, a bipancyclic graph is defined to be a bipartite graph with cycles of every even size from 4 vertices up to the number of vertices in the graph. Cutting edge research and fundamental results on pancyclic and bipartite graphs from a wide range of journal articles and conference proceedings are composed in this book to create a standalone presentation. The following questions are highlighted through the book: - What is the smallest possible number of edges in a pancyclic graph with v vertices? - When do pancyclic graphs exist with exactly one cycle of every possible length? - What is the smallest possible number of edges in a bipartite graph with v vertices? - When do bipartite graphs exist with exactly one cycle of every possible length?