Independence numbers of product graphs

DOI10.1016/0893-9659(94)90018-3zbMath0811.05033OpenAlexW1999753937MaRDI QIDQ5906581

Pranava K. Jha, Giora Slutzki

Publication date: 22 September 1994

Published in: Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0893-9659(94)90018-3

zbMATH Keywords

greedy algorithmindependence numberKronecker-productCartesian-product graphstrong-product graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (05C99)

Related Items (13)

Some Vertex-Graph Parameters on Modular Product of Graphs ⋮ The independence number of the strong product of odd cycles ⋮ The independence number of the strong product of cycles ⋮ On the strong metric dimension of Cartesian and direct products of graphs ⋮ On independent domination in direct products ⋮ Maximum induced forests of product graphs ⋮ On the independence graph of a graph ⋮ On the strong metric dimension of the strong products of graphs ⋮ Strong triadic closure in cographs and graphs of low maximum degree ⋮ 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 ⋮ Optimization problems on posets with regard to formal concept analysis ⋮ On well-covered direct products

Cites Work

• Parallel concepts in graph theory
• On the Shannon capacity of a graph
• On a Problem of C. E. Shannon in Graph Theory
• The Categorical Product of Graphs
• Independence numbers of product graphs

This page was built for publication: Independence numbers of product graphs