261,89 €
Algebraic Elements of Graphs
Algebraic Elements of Graphs
  • Sold out
Algebraic Elements of Graphs
Algebraic Elements of Graphs
El. knyga:
261,89 €
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. ContentsAbstract GraphsAbstract MapsDu…
0

Algebraic Elements of Graphs (e-book) (used book) | bookbook.eu

Reviews

Description

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. ContentsAbstract GraphsAbstract MapsDualityOrientabilityOrientable MapsNonorientable MapsIsomorphisms of MapsAsymmetrizationAsymmetrized Petal BundlesAsymmetrized MapsMaps within SymmetryGenus PolynomialsCensus with PartitionsEquations with PartitionsUpper Maps of a GraphGenera of a GraphIsogemial GraphsSurface Embeddability

261,89 €
Log in and for this item
you will receive
2,62 Book Euros! ?

Electronic book:
Delivery after ordering is instant! Intended for reading only on a computer, tablet or other electronic device.

Lowest price in 30 days: 261,89 €

Lowest price recorded: Price has not changed

  • Author: Yanpei Liu
  • Publisher:
  • Year: 2017
  • Pages: 422
  • ISBN: 9783110481846
  • ISBN-10: 3110481847
  • ISBN-13: 9783110481846
  • Format: PDF
  • Language: English English

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. ContentsAbstract GraphsAbstract MapsDualityOrientabilityOrientable MapsNonorientable MapsIsomorphisms of MapsAsymmetrizationAsymmetrized Petal BundlesAsymmetrized MapsMaps within SymmetryGenus PolynomialsCensus with PartitionsEquations with PartitionsUpper Maps of a GraphGenera of a GraphIsogemial GraphsSurface Embeddability

Reviews

  • No reviews
0 customers have rated this item.
5
0%
4
0%
3
0%
2
0%
1
0%
(will not be displayed)