Name
Abstract | ||
|---|---|---|
Consider all k-element subsets and ℓ-element subsets (k>ℓ) of an n-element set as vertices of a bipartite graph. Two vertices are adjacent if the corresponding ℓ-element set is a subset of the corresponding k-element set. Let Gk,ℓ denote this graph The domination number of Gk,1 will exactly be determined. We also give lower and upper estimates on the domination number Gk,2 and pose a conjecture of asymptotic nature. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1016/j.dam.2019.02.006 | Discrete Applied Mathematics |
Keywords | Field | DocType |
Domination number,Turán theorem,Transversal design | Graph,Discrete mathematics,Combinatorics,Vertex (geometry),Bipartite graph,Domination analysis,Conjecture,Mathematics | Journal |
Volume | ISSN | Citations |
266 | 0166-218X | 1 |
PageRank | References | Authors |
0.48 | 1 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Leila Badakhshian | 1 | 1 | 0.82 |
| Gyula O. H. Katona | 2 | 264 | 66.44 |
| Zsolt Tuza | 3 | 1889 | 262.52 |