Fr. 70.00

Pancyclic and Bipancyclic Graphs

English · Paperback / Softback

Shipping usually within 6 to 7 weeks

Description

Read more

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?

List of contents

1.Graphs.- 2. Degrees and Hamiltoneity.- 3. Pancyclicity.- 4. Minimal Pancyclicity.- 5. Uniquely Pancyclic Graphs.- 6. Bipancyclic Graphs.- 7. Uniquely Bipancyclic Graphs.- 8. Minimal Bipancyclicity.- References. 

Additional text

“In this book, the authors give a simple survey about the sufficient conditions for a graph to be pancyclic (uniquely bipancyclic). Moreover, the authors give the proofs of some classic results which are useful tools to study and generalize cycle problems. Therefore, this book can help students and researchers alike to find inspiration and ideas on pancyclic and bipancyclic problems.” (Junqing Cai, Mathematical Reviews, February, 2017)

Report

"In this book, the authors give a simple survey about the sufficient conditions for a graph to be pancyclic (uniquely bipancyclic). Moreover, the authors give the proofs of some classic results which are useful tools to study and generalize cycle problems. Therefore, this book can help students and researchers alike to find inspiration and ideas on pancyclic and bipancyclic problems." (Junqing Cai, Mathematical Reviews, February, 2017)

Product details

Authors John C. George, Abdollah Khodkar, W. D. Wallis, W.D. Wallis
Publisher Springer, Berlin
 
Languages English
Product format Paperback / Softback
Released 27.05.2016
 
EAN 9783319319506
ISBN 978-3-31-931950-6
No. of pages 108
Dimensions 159 mm x 9 mm x 240 mm
Weight 200 g
Illustrations XII, 108 p. 64 illus.
Series SpringerBriefs in Mathematics
Subjects Natural sciences, medicine, IT, technology > Mathematics > Miscellaneous

C, Diskrete Mathematik, Numerische Mathematik, Combinatorics, Mathematics and Statistics, Discrete Mathematics, Combinatorics & graph theory, Numerical analysis, Graph Theory, undirected graph, node-pancyclic, vertex-pancyclic, Hamiltonian graphs, bipartite graph, edge-pancyclic

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.