On Genus of Circulant Graphs
Author : J. E. Strapasson
Publisher :
Page : 24 pages
File Size : 18,37 MB
Release : 2007
Category : Graph theory
ISBN :
Author : J. E. Strapasson
Publisher :
Page : 24 pages
File Size : 18,37 MB
Release : 2007
Category : Graph theory
ISBN :
Author :
Publisher :
Page : 28 pages
File Size : 35,9 MB
Release : 2007
Category :
ISBN :
Author : Yanpei Liu
Publisher : Walter de Gruyter GmbH & Co KG
Page : 369 pages
File Size : 24,31 MB
Release : 2017-03-06
Category : Mathematics
ISBN : 3110479494
This book introduces polyhedra as a tool for graph theory and discusses their properties and applications in solving the Gauss crossing problem. The discussion is extended to embeddings on manifolds, particularly to surfaces of genus zero and non-zero via the joint tree model, along with solution algorithms. Given its rigorous approach, this book would be of interest to researchers in graph theory and discrete mathematics.
Author : Jonathan L. Gross
Publisher : CRC Press
Page : 1634 pages
File Size : 11,6 MB
Release : 2013-12-17
Category : Mathematics
ISBN : 1439880182
In the ten years since the publication of the best-selling first edition, more than 1,000 graph theory papers have been published each year. Reflecting these advances, Handbook of Graph Theory, Second Edition provides comprehensive coverage of the main topics in pure and applied graph theory. This second edition—over 400 pages longer than its predecessor—incorporates 14 new sections. Each chapter includes lists of essential definitions and facts, accompanied by examples, tables, remarks, and, in some cases, conjectures and open problems. A bibliography at the end of each chapter provides an extensive guide to the research literature and pointers to monographs. In addition, a glossary is included in each chapter as well as at the end of each section. This edition also contains notes regarding terminology and notation. With 34 new contributors, this handbook is the most comprehensive single-source guide to graph theory. It emphasizes quick accessibility to topics for non-experts and enables easy cross-referencing among chapters.
Author : Yanpei Liu
Publisher : Walter de Gruyter GmbH & Co KG
Page : 424 pages
File Size : 15,8 MB
Release : 2017-09-11
Category : Mathematics
ISBN : 3110481847
This book studies algebraic representations of graphs in order to investigate combinatorial structures via local symmetries. Topological, combinatorial and algebraic classifications are distinguished by invariants of polynomial type and algorithms are designed to determine all such classifications with complexity analysis. Being a summary of the author‘s original work on graph embeddings, this book is an essential reference for researchers in graph theory. Contents Abstract Graphs Abstract Maps Duality Orientability Orientable Maps Nonorientable Maps Isomorphisms of Maps Asymmetrization Asymmetrized Petal Bundles Asymmetrized Maps Maps within Symmetry Genus Polynomials Census with Partitions Equations with Partitions Upper Maps of a Graph Genera of a Graph Isogemial Graphs Surface Embeddability
Author :
Publisher :
Page : 22 pages
File Size : 14,59 MB
Release : 2006
Category :
ISBN :
Author : Lowell W. Beineke
Publisher : Cambridge University Press
Page : 302 pages
File Size : 27,21 MB
Release : 2004-10-04
Category : Mathematics
ISBN : 9780521801973
There is no other book with such a wide scope of both areas of algebraic graph theory.
Author : Andrew V. Goldberg
Publisher : Springer
Page : 400 pages
File Size : 17,24 MB
Release : 2016-05-31
Category : Computers
ISBN : 3319388517
This book constitutes the refereed proceedings of the 15th International Symposium on Experimental Algorithms, SEA 2016, held in St. Petersburg, Russia, in June 2016. The 25 revised full papers presented were carefully reviewed and selected from 54 submissions. The main theme of the symposium is the role of experimentation and of algorithm engineering techniques in the design and evaluation of algorithms and data structures. SEA covers a wide range of topics in experimental algorithmics, bringing together researchers from algorithm engineering, mathematical programming, and combinatorial optimization communities.
Author : Ulrich Knauer
Publisher : Walter de Gruyter GmbH & Co KG
Page : 350 pages
File Size : 40,62 MB
Release : 2019-10-08
Category : Mathematics
ISBN : 3110617366
Graph models are extremely useful for a large number of applications as they play an important role as structuring tools. They allow to model net structures – like roads, computers, telephones, social networks – instances of abstract data structures – like lists, stacks, trees – and functional or object oriented programming. The focus of this highly self-contained book is on homomorphisms and endomorphisms, matrices and eigenvalues.
Author : Jonathan L. Gross
Publisher : Courier Corporation
Page : 386 pages
File Size : 16,23 MB
Release : 2001-01-01
Category : Mathematics
ISBN : 0486417417
Iintroductory treatment emphasizes graph imbedding but also covers connections between topological graph theory and other areas of mathematics. Authors explore the role of voltage graphs in the derivation of genus formulas, explain the Ringel-Youngs theorem, and examine the genus of a group, including imbeddings of Cayley graphs. Many figures. 1987 edition.