Domination in Circulant Graphs: Domination, Connected, Total and Independent domination in Circulant Graphs,Used

Domination in Circulant Graphs: Domination, Connected, Total and Independent domination in Circulant Graphs,Used

In Stock
SKU: DADAX3843392838
Brand: LAP Lambert Academic Publishing
Condition: New
Regular price$98.55
Free Standard Shipping Across USA
Quantity
Add to wishlist
Add to compare

Sold by Ergodebooks, an authorized reseller.

Returns accepted within 30 days | support@ergodebooks.com

Verified
Shipping Information
  • Free Standard Shipping — United States only
  • Processing Time: 3–5 business days
  • Estimated Delivery: 6–10 business days after dispatch
  • Double-boxed, fully insured & discreetly packaged
  • Tracking number sent via email once dispatched
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

All returns require a Return Authorization (RA) number before sending.

To initiate a return, contact us:

support@ergodebooks.com +1 (281) 738-1050
View Full Return & Refund Policy
Payment Option
Payment Methods

Help

If you have any questions, you are always welcome to contact us. We'll get back to you as soon as possible, withing 24 hours on weekdays.

Customer service

All questions about your order, return and delivery must be sent to our customer service team by e-mail at yourstore@yourdomain.com

Sale & Press

If you are interested in selling our products, need more information about our brand or wish to make a collaboration, please contact us at press@yourdomain.com

Parallel processing and supercomputing continue to exert great influence in the development of modern science and engineering. The network of processors and interconnections play a vital role in facilitating the communication between processors in a parallel computer. Some of the popular interconnection schemes are rings, toroids and hypercubes. Their popularity stems from the commercial availability of machines with these architectures. These three families of graphs viz., rings, toroids and hypercubes share a common property of being a Cayley graph. Many important problems in networks have been modeled by Cayley graphs. One of the principal issues concerning routing problems is identification of perfect dominating sets in Cayley graphs. Circulant graphs are Cayley graphs constructed on finite cyclic groups. This book deals with domination in circulant graphs in general and some methodologies to determine dominating sets, independent dominating sets, total dominating sets and connected dominating sets in circulant graphs constructed from certain specified generating sets in particular. Domination in directed circulant graph is also dealt with.

⚠️ 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.

Recently Viewed