Title
Distance in Fuzzy Graphs: gdistance, distance, d distance, and ssdistance,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
This work mainly focuses on different distance concepts in fuzzy graphs. The properties of d distance, distance and gdistance are studied and defined ssdistance in a connected fuzzy graph. A study of gdistance in a fuzzy tree and its associated maximum spanning tree is carried out.Various types of degrees of a node and its properties in fuzzy graphs are studied. The concept of strong cycle is introduced and studied the properties of fuzzy end nodes and strong cycles in a fuzzy graph. Clustering techniques using distance concepts in fuzzy graphs are discussed and introduced a procedure for finding clusters of order k using distance matrix. Also clustering techniques based on the connectedness concepts in fuzzy graphs are discussed. Fuzzy graph theoretic techniques are applied in fuzzy neural network.
⚠️ 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.