On the number of independent sets in the trees of a fixed diameter-Reference-Cited by-同舟云学术

On the number of independent sets in the trees of a fixed diameter

Published:2010-04 Issue:2 Volume:4 Page:163-171
ISSN:1990-4789
Container-title:Journal of Applied and Industrial Mathematics
language:en
Short-container-title:J. Appl. Ind. Math.

Author:

Dainyak A. B.

Publisher

Pleiades Publishing Ltd

Subject

Applied Mathematics,Industrial and Manufacturing Engineering

Link

http://link.springer.com/content/pdf/10.1134/S1990478910020043.pdf

Reference3 articles.

1. A. B. Dainiak, “Sharp Bounds for the Number of Maximal Independent Sets in Trees of Fixed Diameter,” arXiv:0812.4948v1.

2. A. Frendrup, A. S. Pedersen, A. A. Sapozhenko, and P. D. Vestergaard, Merrifield-Simmons Index and Minimum Number of Independent Sets in Short Trees, Research Report Series, ISSN 1399-2503, R-2009-03 (Department of Mathematical Sciences, Aalborg Univ., 2009).

3. A. S. Pedersen and P. D. Vestergaard, “An Upper Bound on the Number of Independent Sets in a Tree,” Ars Combinatoria 84, 85–96 (2007).

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On Trees with a Given Diameter and the Extremal Number of Distance-$$k$$ Independent Sets;Journal of Applied and Industrial Mathematics;2023-09

2. Independence Polynomials of Bipartite Graphs;Bulletin of the Malaysian Mathematical Sciences Society;2022-06-09

3. Trees with a given number of leaves and the maximal number of maximum independent sets;Discrete Mathematics and Applications;2021-04-01

4. Trees of Diameter 6 and 7 with Minimum Number of Independent Sets;Mathematical Notes;2021-01

5. Independent sets in graphs;Discrete Mathematics and Applications;2016-01-01