Výsledky vyhledávání - "Frendrup, Allan"

Akademický článek

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

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

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

Zobrazit plný text záznamu

On a Conjecture about Inverse Domination in Graphs

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

Publikováno v: Frendrup, A, Henning, M A, Randerath, B & Vestergaard, P D 2010, ' On a Conjecture about Inverse Domination in Graphs ', Ars Combinatoria, vol. 97A, pp. 129-143 .

Let G = (V, E) be a graph with no isolated vertex. A classical observation in domination theory is that if D is a minimum dominating set of G, then V \ D is also a dominating set of G. A set D' is an inverse dominating set of G if D' is a dominating

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::f61036ba9c069c516e0322c331efbf0b
https://vbn.aau.dk/da/publications/29e4701d-4f51-42ef-a873-f24f1738898b

Zobrazit plný text záznamu

A note on equimatchable graphs

Autor: Frendrup, Allan, Hartnell, Bert, Vestergaard, Preben D.

Publikováno v: Frendrup, A, Hartnell, B & Vestergaard, P D 2010, ' A note on equimatchable graphs ', Australasian Journal of Combinatorics, vol. 46, pp. 185-190 .

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::bd38ff6dc384e8f248cada1ad225bc72
https://vbn.aau.dk/da/publications/3b8d3950-d37c-11de-bb13-000ea68e967b

Zobrazit plný text záznamu

Total well dominated trees

Autor: Finbow, Arthur, Frendrup, Allan, Vestergaard, Preben D.

Publikováno v: Finbow, A, Frendrup, A & Vestergaard, P D 2009, Total well dominated trees . Research Report Series, no. R-2009-14, Department of Mathematical Sciences, Aalborg University, Aalborg .

Let G = (V,E) be a graph with no isolated vertex. A set D is called total dominating in G if each vertex in G is adjacent to a vertex from D, and D is a minimal total dominating set if any subset D′ ⊂ D is not a total dominating set in G. If all

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::4b30486f8072239f65d3232dec73aef8
https://vbn.aau.dk/da/publications/79f8e960-909b-11de-90ca-000ea68e967b

Zobrazit plný text záznamu

A note on equimatchable graphs

Autor: Frendrup, Allan, Hartnell, Bert, Vestergaard, Preben D.

Publikováno v: Frendrup, A, Hartnell, B & Vestergaard, P D 2009, A note on equimatchable graphs . Research Report Series, no. R-2009-07, Department of Mathematical Sciences, Aalborg University, Aalborg .

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::be122fa243185dfdc65af87386cf4305
https://vbn.aau.dk/ws/files/17411911/R-2009-07.pdf

Zobrazit plný text záznamu

On a conjecture about inverse domination in graphs

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

Publikováno v: Frendrup, A, Henning, M A, Randerath, B & Vestergaard, P D 2009, On a conjecture about inverse domination in graphs . Research Report Series, no. R-2009-09, Department of Mathematical Sciences, Aalborg University, Aalborg .

Let G = (V,E) be a graph with no isolated vertex. A classical observation in domination theory is that if D is a minimum dominating set of G, then V \D is also a dominating set of G. A set D′ is an inverse dominating set of G if D′ is a dominatin

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::8914e8f68ac8ef368b5b8a4ec867aff2
https://vbn.aau.dk/da/publications/63133020-3fa1-11de-9808-000ea68e967b

Zobrazit plný text záznamu

Merrifield-Simmons index and minimum number of independent sets in shor trees

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

Publikováno v: Frendrup, A, Pedersen, A S, Sapozhenko, A A & Vestergaard, P D 2009, Merrifield-Simmons index and minimum number of independent sets in shor trees . Research Report Series, no. R-2009-03, Department of Mathematical Sciences, Aalborg University, Aalborg .

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

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::7d9b3788b8f3f442d32e428a3f8d2d37
https://vbn.aau.dk/ws/files/16533041/R-2009-03.pdf

Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání