Name
Abstract | ||
|---|---|---|
For any graph G, let a alpha'(G) and alpha(min)'(G) be the maximum cardinality and minimum cardinality among all maximal matchings in G, respectively, and let gamma'(G) and gamma(t)'(G) be the edge domination number and edge total domination number of G, respectively. In this paper, we first show some properties of maximal matchings and further determine the exact values of alpha'(G) and alpha(min)'(G) for a complete multipartite graph G. Then, we disclose relationships between maximal matchings and minimal edge dominating sets, and thus obtain the exact values of gamma'(G) and gamma(t)' (G) for a complete multipartite graph G. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1080/00207160.2013.818668 | International Journal of Computer Mathematics |
Keywords | Field | DocType |
complete multipartite graph,edge domination,edge total domination,maximal matching | Discrete mathematics,Graph,Combinatorics,Multipartite,Cardinality,Matching (graph theory),Multipartite graph,Domination analysis,Mathematics | Journal |
Volume | Issue | ISSN |
91 | 5 | 0020-7160 |
Citations | PageRank | References |
0 | 0.34 | 3 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Wenyao Song | 1 | 0 | 0.34 |
| Lianying Miao | 2 | 11 | 2.56 |
| Haichao Wang | 3 | 83 | 11.57 |
| Yancai Zhao | 4 | 0 | 1.01 |