On the number of independent subsets in trees with restricted degrees

DOI10.1016/j.mcm.2010.10.003zbMath1217.05173OpenAlexW2070576964MaRDI QIDQ552058

Eric Ould Dadah Andriantiana, Stephan G. Wagner

Publication date: 21 July 2011

Published in: Mathematical and Computer Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.mcm.2010.10.003

zbMATH Keywords

topological indexindependent setsextremal treesrestricted degree

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Applications of graph theory (05C90) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (3)

The Fibonacci numbers of certain subgraphs of circulant graphs ⋮ Convex Characters, Algorithms, and Matchings ⋮ On the Fibonacci numbers of the composition of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Maxima and minima of the Hosoya index and the Merrifield-Simmons index
• On the minimal energy of trees with a given diameter
• The Merrifield - Simmons indices and Hosoya indices of trees with \(k\) pendant vertices
• On extremal unicyclic molecular graphs with maximal Hosoya index
• Minimizing a class of unicyclic graphs by means of Hosoya index
• Fibonacci numbers and Lucas numbers in graphs
• A sharp upper bound for the number of stable sets in graphs with given number of cut edges
• Wiener index versus maximum degree in trees
• The smallest Merrifield-Simmons index of \((n,n+1)\)-graphs
• The number of independent sets in unicyclic graphs
• Largest Number of Subtrees of Trees with a Given Maximum Degree
• Maximizing the number of independent subsets over trees with bounded degree

This page was built for publication: On the number of independent subsets in trees with restricted degrees