Now showing items 1-2 of 2
Note on Nordhaus-Gaddum problems for Colin de Verdiere type parameters
(Public Knowledge Network, 2013)
We establish the bounds 4 on the Nordhaus- Gaddum sum upper bound multipliers for all graphs G, in connections with certain Colin de Verdi ere type graph parameters. The Nordhaus-Gaddum sum lower bound is conjectured ...
Parameters Related to Tree-Width, Zero Forcing, and Maximum Nullity of a Graph
(Wiley Periodicals, Inc., 2013)
Tree-width, and variants that restrict the allowable tree decompositions, play an important role in the study of graph algorithms and have application to computer science. The zero forcing number is used to study the ...