Title
Wiener index of graphs: Some GraphTheoretic and Computational Aspects,Used
Sold by Ergodebooks, an authorized reseller.
Returns accepted within 30 days | support@ergodebooks.com
Shipping Information
- Free Standard Shipping — United States only
- Processing Time: 1–3 business days
- Estimated Delivery: 3–5 business days after dispatch
- Double-boxed, fully insured & discreetly packaged
- Tracking number sent via email once dispatched
- Orders over $250 require signature upon delivery. Taxes calculated at checkout.
Returns & Refund
Returns accepted within 30 days of delivery.
Damaged or Defective Item
Free return shipping + replacement or full refund
Wrong Item Received
Free return shipping + replacement or full refund
Change of Mind
Return shipping at customer's expense · 25% restocking fee applies
Payment Option
The contemporary literature cites Wiener index as a topological parameter associated with treelike molecular graphs derived from organic molecular structures. Given a graph G the corresponding Wiener index or total distance W(G) is defined as the sum of the graphic distances reckoned across all possible vertexpairs of G. Then W(G) of a graph G may be corelated to the physicochemical properties of an organic compound represented as G. This book explores some combinatorial and graph theoretic aspects of Wiener index of broad interest to practical Computer Scientists and Mathematicians. Such aspects are considered relevant to the process of drug synthesis and in the identification of lead drug candidates. It may be noted that the study of Wiener index and its variants are current areas of research from the standpoint of Mathematical Chemistry.
⚠️ WARNING (California Proposition 65):
This product may contain chemicals known to the State of California to cause cancer, birth defects, or other reproductive harm.
For more information, please visit www.P65Warnings.ca.gov.