Efficient algorithms for combinatorial problems on graphs with bounded, decomposability—a survey
BIT - Ellis Horwood series in artificial intelligence
The matching polynomial of a polygraph
Discrete Applied Mathematics
Discrete Mathematics - Topics on domination
Handbook of theoretical computer science (vol. A)
The domination numbers of the 5 x n and 6 x n grid graphs
Journal of Graph Theory
Dominating Cartesian products of cycles
Discrete Applied Mathematics
Algebraic approach to fasciagraphs and rotagraphs
Discrete Applied Mathematics
On domination numbers of Cartesian product of paths
Discrete Applied Mathematics
Distance-related invariants on polygraphs
Discrete Applied Mathematics - Special issue: 50th anniversary of the Wiener index
Complexity of domination-type problems in graphs
Nordic Journal of Computing
Practical Algorithms on Partial k-Trees with an Application to Domination-like Problems
WADS '93 Proceedings of the Third Workshop on Algorithms and Data Structures
| Hi-index | 0.00 |
Recently, an algebraic approach which can be used to compute distance-based graph invariants on fasciagraphs and rotagraphs was given in [Mohar, Juvan, Žerovnik, Discrete Appl. Math. 80 (1997) 57-71]. Here we give an analogous method which can be employed for deriving formulas for the domination number of fasciagraphs and rotagraphs. In other words, it computes the domination numbers of these graphs in constant time, i.e. in time which depends only on the size and structure of a monograph and is independent of the number of monographs. Some further generalizations of the method are discussed, in particular the computation of the independent number and the k-coloring decision problem. Examples of fasciagraphs and rotagraphs include complete grid graphs. Grid graphs are one of the most frequently used model of processor interconnections in multiprocessor VLSI systems.