An upper bound on the domination number of a graph with minimum degree 2

Autor: Frendrup, Allan, Henning, Michael A., Randerath, Bert, Vestergaard, Preben Dahl

Publikováno v: In Discrete Mathematics 2009 309(4):639-646

Total Domination in Partitioned Graphs.

Autor: Frendrup, Allan¹, Vestergaard, Preben Dahl¹, Yeo, Anders²

Publikováno v: Graphs & Combinatorics. May2009, Vol. 25 Issue 2, p181-196. 16p.

Generalized connected domination in graphs.

Autor: Kouider, Mekkia¹ km@lri.fr, Vestergaard, Preben Dahl² pdv@math.aau.dk

Publikováno v: Discrete Mathematics & Theoretical Computer Science (DMTCS). Jun2006, Vol. 8 Issue 3, p57-63. 7p.

Connected Factors in Graphs - a Survey.

Autor: Kouider, Mekkia¹ km@lri.fr, Vestergaard, Preben Dahl² pdv@math.aau.dk

Publikováno v: Graphs & Combinatorics. Mar2005, Vol. 21 Issue 1, p1-26. 26p.

Merrifield-simmons index and minimum number of independent sets in short trees

Autor: Frendrup, Allan, Pedersen, Anders Sune, Sapozhenko, Alexander A., Vestergaard, Preben Dahl

Publikováno v: Frendrup, A, Pedersen, A S, Sapozhenko, A A & Vestergaard, P D 2013, ' Merrifield-simmons index and minimum number of independent sets in short trees ', Ars Combinatoria, vol. 111, pp. 85-95 . < http://www.scopus.com/inward/record.url?scp=84902583770&partnerID=8YFLogxK >

In Ars Comb. 84 (2007),85-96, Pedersen and Vestergaard posed the problem of determining a lower bound for the number of independent sets in a tree of fixed order and diameter d. Asymptotically, we give here a complete solution for trees of diameter d

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::8bbb7b84a7566c84ca8cbdc04e15179d
https://vbn.aau.dk/da/publications/7dab3b29-be05-46fa-8552-2bc8095f1748