Maximal independent sets in complementary prism graphs.

MaRDI QIDQ4568172zbMATH OpenFDO

Authors Márcia R. Cappelle, Erika M. M. Coelho, Rommel Barbosa

Publication date 15 June 2018

zbMATH Keywords

maximal independent setwell-covered graph

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Independent domination in complementary prisms
• Complexity properties of complementary prisms
• Domination and total domination in complementary prisms
• Average independent domination in complementary prisms
• scientific article; zbMATH DE number 6828923

Cited in

(8)

• Strong independent saturation in complementary prisms
• Average independent domination in complementary prisms
• Remarks on k-clique, k-independent set and 2-contamination in complementary prisms
• The core of a complementary prism
• The core of a vertex-transitive complementary prism
• k-independence on complementary prism graphs
• Complexity results on \(k\)-independence in some graph products
• The automorphism group of a complementary prism

This page was built for publication: Maximal independent sets in complementary prism graphs.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4568172)