Pancyclic and Bipancyclic Graphs. Este artículo no está disponible.
Idioma: inglés
Editorial: Springer Verlag, 2016
- Tapa blanda
- Nuevo
Librería: Revaluation Books, Exeter, Reino UnidoRevaluation Books
Vendedor de AbeBooks desde el 6 de enero de 2003
Condición: Nuevo
EUR 101,54
Descripción del artículo del vendedor
120 pages. 9.25x6.25x0.50 inches. In Stock.
N° de ref. del artículo __3319319507
- Título
- Pancyclic and Bipancyclic Graphs
- Autor
- Khodkar, Abdollah/ George, John C./ Wallis, W. D.
- Editorial
- Springer Verlag
- Año de publicación
- 2016
- Estado
- Brand New
- Encuadernación
- Paperback
- Idioma
- inglés
- ISBN 10
- 3319319507
- ISBN 13
- 9783319319506
- Peso del artículo
- 1,95 kilogramos
- Serie
- Libro 71 de 155: SpringerBriefs in Mathematics
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?
“Sinopsis” puede pertenecer a otra edición de este título.
De la contraportada
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?
“Acerca de” puede pertenecer a otra edición de este título.