scientific article; zbMATH DE number 975356

zbMATH Open0862.05067MaRDI QIDQ5284028FDOQ5284028

Authors: David C. Fisher, Jason M. Nonis 

Publication date: 19 May 1997

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

Recommendations

• Bounds on the largest root of the matching polynomial
• Dependence polynomials
• On the dependence polynomial of a graph
• scientific article; zbMATH DE number 951843

zbMATH Keywords

matchingboundsmatching polynomialgrowth factordependence polynomial

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Cited In (9)

• Bounds on the largest root of the matching polynomial
• Title not available (Why is that?)
• On the dependence polynomial of a graph
• A Bernstein inequality for exponentially growing graphs
• On the maximum number of cliques in a graph
• Dependence polynomials
• The rate of growth of the minimum clique size of graphs of given order and chromatic number
• The Growth of Infinite Graphs: Boundedness and Finite Spreading
• A sharp bound for the growth of minimal graphs

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 Q5284028)