The independence number of the strong product of odd cycles

DOI10.1016/S0012-365X(97)00156-8zbMath0893.05007OpenAlexW1966342770WikidataQ114122934 ScholiaQ114122934MaRDI QIDQ1379990

Janez Žerovnik, Aleksander Vesel

Publication date: 11 August 1998

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(97)00156-8

zbMATH Keywords

independence numberodd cyclesstrong product

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38)

Related Items (5)

Some Vertex-Graph Parameters on Modular Product of Graphs ⋮ The independence number of the strong product of cycles ⋮ NISPOC ⋮ The \(k\)-path vertex cover in Cartesian product graphs and complete bipartite graphs ⋮ The \(k\)-path vertex cover of rooted product graphs

Cites Work

• The independence number of the strong product of cycles
• Numerical invariants and the strong product of graphs
• Analogues of the Shannon Capacity of a Graph
• A generalized measure of independence and the strong product of graphs
• Independence numbers of product graphs
• Independence numbers of product graphs

This page was built for publication: The independence number of the strong product of odd cycles