Home
»
Fundamentals of Domination in Graphs
Fundamentals of Domination in Graphs
★★★★★
★★★★★
Regular price
€322.40
A01=Peter Slater
A01=Stephen Hedetniemi
A01=Teresa W. Haynes
advanced domination algorithms in graphs
algorithmic complexity
Author_Peter Slater
Author_Stephen Hedetniemi
Author_Teresa W. Haynes
Category=PBV
Category=PBW
chordal
Chordal Graph
combinatorial optimization
connected
Connected Graphs
Cycle C3
Db D2
discrete mathematics
dominating
Dominating Set
Domination Number
eq_isMigrated=1
eq_isMigrated=2
eq_nobargain
Extremal Graphs
graph theory algorithms
Hamiltonian Path
independent
Independent Dominating Sets
Independent Set
Induced Subgraph
Interval Graph
Irredundant Set
isolated
Isolated Vertex
mathematical modeling
maximal
Maximal Independent Set
Maximal Irredundant Set
Maximum Cardinalities
Minimum Cardinality
Minimum Dominating Set
NP-completeness analysis
number
Permutation Graphs
Series Parallel Graphs
set
Total Domination Number
vertex
Vertex Cover
Vertex Independence Number
vertices
Vizing's Conjecture
Product details
- ISBN 9780824700331
- Weight: 740g
- Dimensions: 152 x 229mm
- Publication Date: 05 Jan 1998
- Publisher: Taylor & Francis Inc
- Publication City/Country: US
- Product Form: Hardback
Delivery/Collection within 10-20 working days
Our Delivery Time Frames Explained
2-4 Working Days: Available in-stock
10-20 Working Days: On Backorder
Will Deliver When Available: On Pre-Order or Reprinting
We ship your order once all items have arrived at our warehouse and are processed. Need those 2-4 day shipping items sooner? Just place a separate order for them!
"Provides the first comprehensive treatment of theoretical, algorithmic, and application aspects of domination in graphs-discussing fundamental results and major research accomplishments in an easy-to-understand style. Includes chapters on domination algorithms and NP-completeness as well as frameworks for domination."
Teresa W. Haynes, Stephen Hedetniemi, Peter Slater
Qty:
