scientific article; zbMATH DE number 1943088

zbMATH Open1030.05090MaRDI QIDQ4409656

Ts. H. Hakobyan

Publication date: 22 February 2004

Title of this publication is not available (Why is that?)

Mathematics Subject Classification ID

Recurrences (11B37) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (3)

Notes on the independence number in the Cartesian product of graphs ⋮ Title not available (Why is that?) ⋮ The number of spanning trees of the Cartesian product of regular graphs

Recommendations

• Independence number and \(k\)-trees of graphs 👍 👎
• The number of spanning trees of the Cartesian product of regular graphs 👍 👎
• Number of spanning trees of different products of complete and complete bipartite graphs 👍 👎
• 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 👍 👎
• Sharp uppper and lower bounds on the number of spanning trees in Cartesian product graphs 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎

This page was built for publication:

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