Domination Stable Graphs: Domination Dot Stable Domatic Dot Stable Domination Subdivision Stable Graphs,Used

Domination Stable Graphs: Domination Dot Stable Domatic Dot Stable Domination Subdivision Stable Graphs,Used

In Stock
SKU: DADAX3659199109
Brand: LAP Lambert Academic Publishing
Condition: New
$92.75
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

The literature on changing and unchanging domination number discusses about the changes in the minimum dominating set on a graph by vertex, edge addition and deletion. Edge contraction and edge subdivision are in some sense duals of each other. In the former case the number of vertices is reduced by one and the number of edges is reduced at least by one while, in the latter case the number of vertices and edges is increased by one. This property of the two graph operations provide a scope to study and compare when and how the minimum dominating set of a graph does not change, on applying these graph operations. This book is dedicated entirely to introduce and explore the stable property of the minimum dominating set of a graph G with respect to the two graph operations. It also relates them to Excellent Graphs. This book would be of interest to researchers working in domination theory.

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