Independent set in categorical products of cographs and splitgraphs

TL;DR

This paper presents polynomial-time algorithms for finding maximum independent sets and computing the independence ratio in categorical products of cographs and splitgraphs, advancing understanding of these graph classes.

Contribution

It introduces new polynomial-time algorithms for maximum independent sets and independence ratios in categorical products of cographs and splitgraphs.

Findings

Polynomial-time algorithms for maximum independent sets in categorical products of cographs and splitgraphs.

Polynomial-time computability of the ultimate categorical independence ratio for cographs.

Enhanced understanding of independence properties in specific graph products.

Abstract

We show that there are polynomial-time algorithms to compute maximum independent sets in the categorical products of two cographs and two splitgraphs. We show that the ultimate categorical independence ratio is computable in polynomial time for cographs.