On weighted efficient total domination

Schaudt, Oliver (2012) On weighted efficient total domination.
Published in: Journal of Discrete Algorithms Vol. 10 (1). pp. 61-69.

Abstract

An efficiently total dominating set of a graph G is a subset of its vertices, such that every vertex of G is adjacent to exactly one vertex of the subset. If there is such a subset, then G is an efficiently total dominatable graph (G is etd). We present two graph classes on which the weighted etd problem is polynomially solvable: claw-free graphs and graphs which only induce cycles of length divisible by four. Furthermore, claw-free etd graphs are shown to be perfect.


Actions:
Download: [img] Postscript - Preprinted Version
Download (576kB) | Preview
Download: [img] PDF - Preprinted Version
Download (148kB) | Preview
Editorial actions: View Item View Item (Login required)
Content information:
Item Type: Article
Citations: 3 (Google Scholar) |
Uncontrolled Keywords: weighted efficient total domination efficient total domination efficient total edge domination total domination
Subjects:
  • 05-XX Combinatorics > 05Cxx Graph theory > 05C50 Graphs and matrices

  • 05-XX Combinatorics > 05Cxx Graph theory > 05C69 Dominating sets, independent sets, cliques

  • 05-XX Combinatorics > 05Cxx Graph theory > 05C70 Factorization, matching, covering and packing

  • 05-XX Combinatorics > 05Cxx Graph theory > 05C65 Hypergraphs

    		•
    Divisions: Institute of Computer Science > Computer Science Department - Prof. Dr. Schrader
    Mathematical Institute > Prof. Dr. Faigle
    Related URLs:
    Deposit Information:
    ZAIK Number: zaik2010-598
    Depositing User: Oliver Schaudt
    Date Deposited: 08 Jun 2011 00:00
    Last Modified: 09 Jan 2012 14:26
    URI: http://e-archive.informatik.uni-koeln.de/id/eprint/598