Domination in graphs

Domination in graphs

by Peter Slater, S.T. Hedetniemi, Stephen Hedetniemi, Teresa W. Haynes, Peter J. Slater

Part of 209

Join Readfeed freeFind clubs reading this
Rate this book:

Browse books you can read free on Readfeed

No club is reading this yet — be the first to start one

3 readers worldwide want to read this book

Start a club free
About
Responding to the increasing interest in, and demand for, in-depth publications in the field, this stimulating new resource presents the latest in graph domination by leading researchers from around the world - furnishing known results, open research problems, and proof techniques. Maintaining standardized terminology and notation throughout for greater accessibility, Domination in Graphs covers recent developments in domination in graphs and digraphs...dominating functions...combinatorial problems on chessboards...Vizing's conjecture...domination algorithms and complexity...varieties of domination...domatic numbers...changing and unchanging domination numbers...and more.

Discuss Domination in graphs with other readers

Join or start a book club for Domination in graphs on Readfeed. Live chat, shared reading progress, and AI discussion questions — free to get started.

Sign up freeBrowse book clubs

Frequently asked questions

How do I join a book club for Domination in graphs?

Sign up free on Readfeed, then browse public clubs or start your own club with Domination in graphs as the current read. Invite friends with a share link and discuss together with live chat and AI discussion questions.

Can I discuss Domination in graphs with other readers online?

Yes. Readfeed book clubs let you chat live, share progress, and join discussions about Domination in graphs with readers worldwide — whether your club is virtual, in-person, or hybrid.

Is Readfeed free?

Yes. Creating an account and joining book clubs is free. Sign up to find readers who love the same books and start discussing today.