Asymptotics of the extremal values of certain graph parameters in trees with bounded degree

zbMATH Open1274.05023MaRDI QIDQ4913489FDOQ4913489

Authors: Clemens Heuberger, Stephan Wagner 

Publication date: 5 April 2013

Recommendations

• Maximizing the number of independent subsets over trees with bounded degree
• On trees of bounded degree with maximal number of greatest independent sets
• scientific article; zbMATH DE number 6470693
• Trees with the mos subtrees - an algorithmic approach
• Counting the maximal independent sets in trees with two degrees of maximum degree

zbMATH Keywords

asymptoticsindependent setsdigit expansion\(d\)-ary trees

Mathematics Subject Classification ID

Trees (05C05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Asymptotic enumeration (05A16) Radix representation; digital problems (11A63)

Cited In (6)

• Maximizing the number of independent subsets over trees with bounded degree
• Trees with minimum number of infima closed sets
• On the asymptotics of degree structure of configuration graphs with bounded number of edges
• Title not available (Why is that?)
• Estimates of general Mayer graphs. I. Construction of upper bounds for a given graph by means of sets of subgraphs. III. Upper bounds obtained by means of spanning n-trees. IV. On the computation of Gaussian integrals by star-mesh transformation
• On the extremal values of ratios of number of paths

This page was built for publication: Asymptotics of the extremal values of certain graph parameters in trees with bounded degree

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