| Presentation | 2010-03-01 Highly connected k-tuple twin dominating sets in iterated line digraphs Toru HASUNUMA, Mayu OTANI, |
|---|---|
| PDF Download Page |  PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | Let G be a d-regular digraph with n vertices. In this paper, we show that the minimum cardinality of a min{k,[d/2] }-connected k-tuple twin dominating set in an iterated line digraph L^m(G) is equal to kdm-in for all m≧2, where 1≦k |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | Dominating set / Connectivity / Arc-disjoint Hamilton cycles / Iterated line digraphs |
| Paper # | CAS2009-89,SIP2009-134,CS2009-84 |
| Date of Issue |
| Conference Information | |
| Committee | CS |
|---|---|
| Conference Date | 2010/2/22(1days) |
| Place (in Japanese) | (See Japanese page) |
| Place (in English) | |
| Topics (in Japanese) | (See Japanese page) |
| Topics (in English) | |
| Chair | |
| Vice Chair | |
| Secretary | |
| Assistant | |
| Paper Information | |
| Registration To | Communication Systems (CS) |
|---|---|
| Language | ENG |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | Highly connected k-tuple twin dominating sets in iterated line digraphs |
| Sub Title (in English) | |
| Keyword(1) | Dominating set |
| Keyword(2) | Connectivity |
| Keyword(3) | Arc-disjoint Hamilton cycles |
| Keyword(4) | Iterated line digraphs |
| 1st Author's Name | Toru HASUNUMA |
| 1st Author's Affiliation | Faculty of Integrated Arts and Sciences, The University of Tokushima() |
| 2nd Author's Name | Mayu OTANI |
| 2nd Author's Affiliation | Faculty of Integrated Arts and Sciences, The University of Tokushima |
| Date | 2010-03-01 |
| Paper # | CAS2009-89,SIP2009-134,CS2009-84 |
| Volume (vol) | vol.109 |
| Number (no) | 436 |
| Page | pp.pp.- |
| #Pages | 4 |
| Date of Issue | |