29 search results - page 2 / 6 » Upper domination and upper irredundance perfect graphs |
COMBINATORICS
2007
13 years 7 months ago
2007
JGAA
2006
13 years 7 months ago
2006
Three classes of graphs, simplicial, upper bound, and middle graphs, have been known for some time, but many of their algorithmic properties have not been published. The definitio...
DM
2007
13 years 7 months ago
2007
An upper bound for the domination number of the direct product of graphs is proved. It in particular implies that for any graphs G and H, γ(G × H) ≤ 3γ(G)γ(H). Graphs with a...
VTS
2006
IEEE
14 years 1 months ago
2006
IEEE
A new algorithm for identifying stuck faults in combinational circuits that cannot be detected by a given input sequence is presented. Other than pre and post-processing steps, ce...
DM
2006
13 years 7 months ago
2006
The forcing number of a perfect matching M of a graph G is the cardinality of the smallest subset of M that is contained in no other perfect matching of G. In this paper, we demon...