DA-IICT Logo

Resource Centre

Pancyclic and bipancyclic graphs (Record no. 33761)

MARC details
000 -LEADER
fixed length control field a
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 250301b xxu||||| |||| 00| 0 eng d
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9783319319506
082 ## - DEWEY DECIMAL CLASSIFICATION NUMBER
Classification number 510
Item number GEO
100 ## - MAIN ENTRY--PERSONAL NAME
Personal name George, John C.
245 ## - TITLE STATEMENT
Title Pancyclic and bipancyclic graphs
260 ## - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT)
Name of publisher, distributor, etc Springer,
Date of publication, distribution, etc 2016
Place of publication, distribution, etc Cham :
300 ## - PHYSICAL DESCRIPTION
Extent xii, 108 p. ;
Other physical details ill.,
Dimensions 24 cm
365 ## - TRADE PRICE
Price amount 49.99
Price type code
Unit of pricing 93.20
490 ## - SERIES STATEMENT
Series statement SpringerBriefs in Mathematics,
Volume number/sequential designation 2191-8201
504 ## - BIBLIOGRAPHY, ETC. NOTE
Bibliography, etc Includes bibliographical references.
520 ## - SUMMARY, ETC.
Summary, etc 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?
650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Numerical analysis
Topical term or geographic name as entry element Graph theory
Topical term or geographic name as entry element Complete bipartite graph
Topical term or geographic name as entry element Contains cycles
Topical term or geographic name as entry element Cycle space
Topical term or geographic name as entry element G contains
Topical term or geographic name as entry element Hamilton cycle
Topical term or geographic name as entry element k-connected graph
Topical term or geographic name as entry element Minimal bipancyclic graphs
Topical term or geographic name as entry element Uniquely bipancyclic graph
700 ## - ADDED ENTRY--PERSONAL NAME
Personal name Khodkar, Abdollah
Personal name Wallis, W. D.
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Source of classification or shelving scheme Dewey Decimal Classification
Item type Books
Holdings
Withdrawn status Lost status Source of classification or shelving scheme Damaged status Not for loan Home library Current library Date acquired Source of acquisition Cost, normal purchase price Total Checkouts Full call number Barcode Date last seen Koha item type
    Dewey Decimal Classification     DAU DAU 21/02/2025 KBD 4659.07   510 GEO 035224 01/03/2025 Books