My Account | Home| Bulletin Board| Cart | Help
Close Session
IISER-KIndian Institute of Science Education & Research - Kolkata
Quick Search
Search Terms:
All Documents
Books
Newspapers
Periodicals
Articles
Theses
E-Books
Database : IISERK

Set Session Filters
Login to ask the library to add a book.
Active Filter Settings
No Active Filters
There are 0 titles in your cart.

Search History
Special Collections: Music Scores
Special Collections: Audio Cassettes
Special Collections: Maps
Special Collections: Government Publications
Serial Collections: Newspapers
ty:m & bl:m
Recommended Reading
first record | previous record | next record | last record
full | marc
Record 1 of 1
  Total Requests  0      Unsatisfied Requests  0
You searched IISERK - Author: Geological Society of India.
Request
Call Number 511.5
Author George, John C. author.
Title Pancyclic and Bipancyclic Graphs [electronic resource] / by John C. George, Abdollah Khodkar, W.D. Wallis.
Material Info. XII, 108 p. 64 illus. online resource.
Series SpringerBriefs in Mathematics, 2191-8198
Series SpringerBriefs in Mathematics, 2191-8198
Summary Note 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?
Notes 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. .
ISBN 9783319319513
Subject Mathematics.
Subject Numerical analysis.
Subject combinatorics.
Subject Graph theory.
Subject Mathematics.
Subject Graph Theory.
Subject Combinatorics.
Subject Numerical Analysis.
Added Entry Khodkar, Abdollah. author.
Added Entry Wallis, W.D. author.
Added Entry SpringerLink (Online service)
Date Year, Month, Day:01806291

Keyword Search

 Words: Search Type:
 
 

Database: IISERK

Any filter options that are chosen below will be combined with the Session Filters and applied to the search.
Nature of Contents Filters Format Filters

Including Excluding

Including Excluding
Language Filters Place of Publication Filters

Including Excluding

Including Excluding
Publication Date Context Date
  -     -  

Set Session Filters
Select below to return to the last:
Copyright © 2014 VTLS Inc. All rights reserved.
VTLS.com