Differentials of Graphs.
Let G=(V,E) be an arbitrary graph, and consider the following game. You are allowed to buy as many tokens from a bank as you like, at a cost of $1 each. For example, suppose you buy k tokens. You then place the tokens on some subset of k vertices of V. For each vertex of G which has no token on it...
Main Author: | Lewis, Jason Robert |
---|---|
Format: | Others |
Published: |
Digital Commons @ East Tennessee State University
2004
|
Subjects: | |
Online Access: | https://dc.etsu.edu/etd/869 https://dc.etsu.edu/cgi/viewcontent.cgi?article=2026&context=etd |
Similar Items
-
β-Differential of a Graph
by: Ludwin A. Basilio, et al.
Published: (2017-09-01) -
Paired-Domination in Grid Graphs.
by: Proffitt, Kenneth Eugene
Published: (2001) -
Paired and Total Domination on the Queen's Graph.
by: Burchett, Paul Asa
Published: (2005) -
Alliance Partitions in Graphs.
by: Lachniet, Jason
Published: (2007) -
Liar's Domination in Grid Graphs
by: Sterling, Christopher Kent
Published: (2012)