The substantial independence number for the strong product of two graphs

DOI10.1080/09720529.2015.1032539zbMATH Open1495.05207OpenAlexW2425370177MaRDI QIDQ5069778

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• The independence number of the strong product of cycles 👍 👎
• Independence number of products of Kneser graphs 👍 👎
• Notes on the independence number in the Cartesian product of graphs 👍 👎
• The independent domination numbers of strong product of two cycles 👍 👎
• The <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"><mml:mi>k</mml:mi></mml:math>-independence number of graph products 👍 👎
• Independence number of generalized products of graphs 👍 👎
• Independence numbers of product 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)