Degree Associated Reconstruction Number of Graphs
Ulam's Conjecture and related problems
Versandkostenfrei!
Versandfertig in 6-10 Tagen
40,99 €
inkl. MwSt.
PAYBACK Punkte
20 °P sammeln!
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 stud...
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.
Andere Kunden interessierten sich für
