Please use this identifier to cite or link to this item:
https://gnanaganga.inflibnet.ac.in:8443/jspui/handle/123456789/7618
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | lzak Broere | - |
dc.date.accessioned | 2024-02-27T06:20:33Z | - |
dc.date.available | 2024-02-27T06:20:33Z | - |
dc.date.issued | 2004 | - |
dc.identifier.uri | http://gnanaganga.inflibnet.ac.in:8080/jspui/handle/123456789/7618 | - |
dc.description.abstract | A tot.al dominating se t of a graph G = (V, E) is a set S o f vertices such that every vertex is adjacent to a vertex in S. Define td (G) as the minimum number of edges that must be added to G to ensure a partition of V into two total dominating sets of the resulting graph . We show that if G is a tree, l(G)/2≤ td(G) ≤l(G) /2 + I, where l(G) is the number or leaves of G. | - |
dc.publisher | Bulletin of the Institute of Combinatorics and Its Applications | - |
dc.title | Augmenting Trees to have Two Disjoint Total Dominating Sets | - |
dc.vol | Vol 42 | - |
Appears in Collections: | Articles to be qced |
Files in This Item:
File | Size | Format | |
---|---|---|---|
Augmenting Trees to have Two Disjoint.pdf Restricted Access | 1.62 MB | Adobe PDF | View/Open Request a copy |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.