Solving the k-independent sets problem of graphs by Gröbner bases

zbMATH Open1289.05365MaRDI QIDQ2859664FDOQ2859664

Xuewei Xiong, Zhiqin Zhao

Publication date: 19 November 2013

Published in: Chinese Journal of Engineering Mathematics (Search for Journal in Brave)

Recommendations

• Solving the algebraic model of \(k\)-dominating sets of graphs by Gröbner bases
• scientific article; zbMATH DE number 6500342
• Finding independent sets in a graph using continuous multivariable polynomial formulations.
• A general approach to deriving the \(g\)-good-neighbor conditional diagnosability of interconnection networks
• Computing dimension and independent sets for polynomial ideals

zbMATH Keywords

\(k\)-independent setmaximal independent setGröbner bases

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)

Cited In (3)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Solving a special case of the P conjecture using dependency graphs with dissolution

This page was built for publication: Solving the \(k\)-independent sets problem of graphs by Gröbner bases

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