40,99 €
inkl. MwSt.
Versandkostenfrei*
Versandfertig in 6-10 Tagen
payback
20 °P sammeln
  • Broschiertes Buch

The Reconstruction Conjecture is the one of the famous unsolved problems in Graph Theory. S. M. Ulam and P.J. Kelly proposed it 1942. In 1985, Harary and Plantholt introduced a parameter, called reconstruction number of graphs, which is expected to serve as a measure of the level of difficulty of reconstructing graphs. This mainly deals with two related parameters, called degree associated reconstruction number and adversary degree associated reconstruction number of graphs. This book discusses all classes of graphs for which these two parameters are known. It is suitable for postgraduate…mehr

Produktbeschreibung
The Reconstruction Conjecture is the one of the famous unsolved problems in Graph Theory. S. M. Ulam and P.J. Kelly proposed it 1942. In 1985, Harary and Plantholt introduced a parameter, called reconstruction number of graphs, which is expected to serve as a measure of the level of difficulty of reconstructing graphs. This mainly deals with two related parameters, called degree associated reconstruction number and adversary degree associated reconstruction number of graphs. This book discusses all classes of graphs for which these two parameters are known. It is suitable for postgraduate students in Mathematics and for research scholars who interested on this topic. Figures are included as visual aids for enhancing the understanding. On the whole, this book must be a good addition to the existing literature on Graph Reconstruction Problems. The author has taken sufficient effort in presenting the results in a systematic manner with enough clarity, so that a reader can do self-study.
Autorenporträt
Monikandan got his Ph.D from Manonmaniam Sundaranar University in 2006 for his thesis on Ulam's Conjecture in Graph Theory. He then worked as a faculty in Annamalai University for a stint of time and moved to M.S.University in 2010. He has guided 2 candidates for Ph.D and has published around 15 papers in leading International Journals.