Loading...
Please wait, while we are loading the content...
Similar Documents
A Note on the Total Domination Supercritical Graphs
| Content Provider | Semantic Scholar |
|---|---|
| Author | Rad, Nader Jafari Abdollahi, Alireza |
| Copyright Year | 2012 |
| Abstract | Let G be a connected spanning subgraph ofKs,s and letH be the complement of G relative to Ks,s. The graph G is k-supercritical relative to Ks,s if γt(G) = k and γt(G + e) = k − 2 for all e ∈ E(H). The 2002 paper by T.W. Haynes, M.A. Henning and L.C. van der Merwe, “Total domination supercritical graphs with respect to relative complements” that appeared in Discrete Mathematics, 258 (2002), 361-371, presents a theorem (Theorem 11) to produce (2k + 2)-supercritical graphs relative to K2k+1,2k+1 of diameter 5, for each k ≥ 2. However, the families of graphs in their proof are not the case. We present a correction of this theorem. |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | http://toc.ui.ac.ir/article_1829_233087645ace589c1ff0904792d8fee7.pdf |
| Language | English |
| Access Restriction | Open |
| Subject Keyword | Complement System Proteins Diameter (qualifier value) Discrete mathematics Dominating set File spanning Graph (discrete mathematics) Graph - visual representation |
| Content Type | Text |
| Resource Type | Article |
