Decomposing G = ( V, E ) into Planar Graphs - Manimuthu, Yamuna;Kumarasamy, Karthika
29,99 €
inkl. MwSt.
Versandkostenfrei*
Versandfertig in 6-10 Tagen
payback
15 °P sammeln
  • Broschiertes Buch

This book is our attempt to answer the question, "Is it possible to decompose any graph G with n vertices, lacking any specific symmetry of the underlying structures?" This book presents a solution to this question by developing iterative techniques in an intuitive, simple, and visual way without losing the essence of the underlying mathematics. We trust that this method of decomposing any graph into known subgraphs will open new directions in graph decomposition. This book will be of interest to researchers in graph theory and discrete mathematics.

Andere Kunden interessierten sich auch für
Produktbeschreibung
This book is our attempt to answer the question, "Is it possible to decompose any graph G with n vertices, lacking any specific symmetry of the underlying structures?" This book presents a solution to this question by developing iterative techniques in an intuitive, simple, and visual way without losing the essence of the underlying mathematics. We trust that this method of decomposing any graph into known subgraphs will open new directions in graph decomposition. This book will be of interest to researchers in graph theory and discrete mathematics.
Autorenporträt
Dr. M. Yamuna is a Professor with 21 years of teaching experience.Dr. K. Karthika is an Assistant Professor (senior) with 12 years of teaching experience. They serve at VIT, Vellore. The authors are interested in applying theoretical graph theory to practical applications, as most applications have strong theoretical foundations behind them.