This is the 1st booklet to target the topological index, the Harary index, of a graph, together with its mathematical houses, chemical purposes and a few comparable and tasty open difficulties. This e-book is devoted to Professor Frank Harary (1921―2005), the grandmaster of graph thought and its purposes. It has be written by way of specialists within the box of graph concept and its purposes. For a attached graph G, as a major distance-based topological index, the Harary index H(G) is outlined because the sum of the reciprocals of the gap among any unordered vertices of the graph G. during this publication, the authors record at the most recent effects at the Harary index of a graph. those effects customarily predicament exterior graphs with recognize to the Harary index; the family members to different topological indices; its houses and functions to natural graph idea and chemical graph idea; and major editions, i.e., additively and multiplicatively weighted Harary indices. within the final bankruptcy, we current a few open difficulties with regards to the Harary index. As such, the ebook won't basically be of curiosity to graph researchers, yet to mathematical chemists as well.
Read or Download The Harary Index of a Graph (SpringerBriefs in Applied Sciences and Technology) PDF
Similar Graph Theory books
Fastened aspect conception and Graph thought presents an intersection among the theories of fastened aspect theorems that provide the stipulations less than which maps (single or multivalued) have ideas and graph thought which makes use of mathematical buildings to demonstrate the connection among ordered pairs of gadgets when it comes to their vertices and directed edges.
This monograph offers and explains the maths in the back of geometric graph thought, which stories the houses of a graph that includes nodes positioned in Euclidean area in order that edges should be additional to attach issues which are with regards to each other. for instance, a set of bushes scattered in a woodland and the disorder that's handed among them, a suite of nests of animals or birds on a zone and the conversation among them or verbal exchange among communications stations or nerve cells.
* what's the essence of the similarity among linearly self sustaining units of columns of a matrix and forests in a graph? * Why does the grasping set of rules produce a spanning tree of minimal weight in a attached graph? * will we try out in polynomial time even if a matrix is completely unimodular? Matroid idea examines and solutions questions like those.
This e-book presents an exhilarating historical past of the invention of Ramsey concept, and comprises new study besides infrequent pictures of the mathematicians who constructed this thought, together with Paul Erdös, B. L. van der Waerden, and Henry Baudet.
Additional resources for The Harary Index of a Graph (SpringerBriefs in Applied Sciences and Technology)