Name
Abstract | ||
|---|---|---|
Let K-d,K-d be a complete bipartite digraph. In this paper, we determine the exact value of the domination number in iterated line digraph of K-d,K-d. |
Year | DOI | Venue |
|---|---|---|
2012 | null | ARS COMBINATORIA |
Keywords | Field | DocType |
Combinatorial problems,Domination number,Complete bipartite digraph,Line digraph | Discrete mathematics,Combinatorics,Bipartite graph,Domination analysis,Iterated function,Digraph,Mathematics | Journal |
Volume | Issue | ISSN |
107 | null | 0381-7032 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Huiping Cai | 1 | 0 | 0.68 |
| Juan Liu | 2 | 20 | 2.58 |
| Jixiang Meng | 3 | 353 | 55.62 |