Graph polynomials

DOI10.5402/2011/193560MaRDI QIDQ643157zbMATH OpenOpenAlexWikidataFDO

Authors Mehdi Alaeiyan, Saeid Mohammadian

Publication date 28 October 2011

Published in ISRN Algebra (Search for Journal in Brave)

Full work available at URL https://doi.org/10.5402/2011/193560

zbMATH Keywords

linear programmingbinary programming

Mathematics Subject Classification ID

Linear programming (90C05) Graph algorithms (graph-theoretic aspects) (05C85) Graph polynomials (05C31) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Recommendations

• Linear programming and primal-dual problems in graph theory
• Graph polynomials
• An algorithm for calculating the independence and vertex-cover polynomials of a graph
• On a class of polynomials associated with the paths in a graph and its application to minimum nodes disjoint path coverings of graphs
• On the characteristic polynomials of covering number of vertices and edges of graphs

Cites work

• scientific article; zbMATH DE number 854567 (Why is no real title available?)
• Constant-time distributed dominating set approximation

Cited in

(4)

• Linear programming and primal-dual problems in graph theory
• Graph-polynomials
• scientific article; zbMATH DE number 6378508 (Why is no real title available?)
• Polynomials on graphs

This page was built for publication: Graph polynomials

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