Pancyclic and Bipancyclic Graphs
May 2016 · Springer
3.0star
1 reviewreport
Ebook
108
Pages
reportRatings and reviews aren’t verified Learn More
About this ebook
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?
Ratings and reviews
3.0
1 review
Rate this ebook
Tell us what you think.
Reading information
Smartphones and tablets
Install the Google Play Books app for Android and iPad/iPhone. It syncs automatically with your account and allows you to read online or offline wherever you are.
Laptops and computers
You can listen to audiobooks purchased on Google Play using your computer's web browser.
eReaders and other devices
To read on e-ink devices like Kobo eReaders, you'll need to download a file and transfer it to your device. Follow the detailed Help Center instructions to transfer the files to supported eReaders.
