## Abstract

We first present polynomial algorithms to compute the independence number of the categorical product for two cographs or two splitgraphs, respectively. Then we prove that computing the maximum independent set of the categorical product of a planar graph of maximum degree three and a K_{4} is NP-complete. The ultimate categorical independence ratio of a graph G is defined as lim_{k→∞}α(G^{k})/n^{k}. The ultimate categorical independence ratio can be computed in polynomial time for cographs, splitgraphs, permutation graphs, interval graphs and graphs of bounded treewidth. Also, we present an O^{*}(3^{n/3})-time exact, exponential algorithm for the ultimate categorical independence ratio of general graphs. We further present a PTAS for the ultimate categorical independence ratio of planar graphs. Lastly, we show that the ultimate categorical independent domination ratio for complete multipartite graphs is zero, except when the graph is complete bipartite with color classes of equal size (in which case it is 1/2).

Original language | English |
---|---|

Pages (from-to) | 81-95 |

Number of pages | 15 |

Journal | Theoretical Computer Science |

Volume | 588 |

DOIs | |

Publication status | Published - 11 Jul 2015 |

Externally published | Yes |

## Keywords

- Categorical product of graphs
- Cographs
- Independence number
- Splitgraphs
- Tensor capacity
- Ultimate categorical independent domination ratio

## ASJC Scopus subject areas

- Theoretical Computer Science
- Computer Science (all)