Combinatorial Rigidity
1/1993 · American Mathematical Soc.
star
1 recenzia
E‑kniha
172
Počet strán
Táto e‑kniha
This book presents rigidity theory in a historical context. The combinatorial aspects of rigidity are isolated and framed in terms of a special class of matroids, which are a natural generalization of the connectivity matroid of a graph. The book includes an introduction to matroid theory and an extensive study of planar rigidity. The final chapter is devoted to higher dimensional rigidity, highlighting the main open questions. Also included is an extensive annotated bibiolography with over 150 entries. The book is aimed at graduate students and researchers in graph theory and combinatorics or in fields which apply the structural aspects of these subjects in architecture and engineering. Accessible to those who have had an introduction to graph theory at the senior or graduate level, the book would be suitable for a graduate course in graph theory.
This book presents rigidity theory in a historical context. The combinatorial aspects of rigidity are isolated and framed in terms of a special class of matroids, which are a natural generalization of the connectivity matroid of a graph. The book includes an introduction to matroid theory and an ...
Zistite viac
Hodnotenia a recenzie
1 recenzia
Ohodnoťte túto elektronickú knihu
Povedzte nám svoj názor.
Informácie o dostupnosti
Smartfóny a tablety
Nainštalujte si aplikáciu Knihy Google Play pre Android a iPad/iPhone. Automaticky sa synchronizuje s vaším účtom a umožňuje čítať online aj offline, nech už ste kdekoľvek.
Laptopy a počítače
Audioknihy zakúpené v službe Google Play môžete počúvať prostredníctvom webového prehliadača v počítači.
Čítačky elektronických kníh a ďalšie zariadenia
Ak chcete tento obsah čítať v zariadeniach využívajúcich elektronický atrament, ako sú čítačky e‑kníh Kobo, musíte stiahnuť príslušný súbor a preniesť ho do svojho zariadenia. Pri prenose súborov do podporovaných čítačiek e‑kníh postupujte podľa podrobných pokynov v centre pomoci.
