Independence number of generalized products of graphs

DOI10.1142/S1793557120500138zbMath1431.05128MaRDI QIDQ5213019

U. P. Acharya, H. S. Mehta

Publication date: 31 January 2020

Published in: Asian-European Journal of Mathematics (Search for Journal in Brave)

zbMATH Keywords

bipartite graphindependence numbernon-bipartite graph\(2\)-Cartesian product\(2\)-tensor product

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

• The \(k\)-independence number of direct products of graphs and Hedetniemi's conjecture
• Associative graph products and their independence, domination and coloring numbers
• Notes on the independence number in the Cartesian product of graphs
• The <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"><mml:mi>k</mml:mi></mml:math>-independence number of graph products
• A textbook of graph theory
• Independence numbers of product graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Independence number of generalized products of graphs