The substantial independence number for the strong product of two graphs

DOI10.1080/09720529.2015.1032539MaRDI QIDQ5069778zbMATH OpenOpenAlexFDO

Authors V. Rani Ratha Bai, S. Robinson Chellathurai, T. Tamizh Chelvam

Publication date 19 April 2022

Published in Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/09720529.2015.1032539

zbMATH Keywords

substantial independence numbersubstantial independent set

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76)

Recommendations

• The \(k\)-independence number of graph products
• Independence numbers of product graphs
• scientific article; zbMATH DE number 1109407
• Independence number of generalized products of graphs
• The independence number of the strong product of cycles
• Independent and vertex covering number on strong product of complete graphs
• Notes on the independence number in the Cartesian product of graphs
• Independent and vertex covering number on strong product of complete bipartite graphs
• The independent domination numbers of strong product of two cycles
• Independence number of products of Kneser graphs

This page was built for publication: The substantial independence number for the strong product of two graphs

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