### Abstract

In a graph G = (V, E), a. set S of vertices (as well as the subgraph induced by S) is said to be dominating if every vertex in V/S has at least one neighbor in S. For a given class D of connected graphs, it is an interesting problem to characterize the class Dom(D) of graphs G such that each connected induced subgraph of G contains a dominating subgraph belonging to D. Here we determine Dom(D) for D = {P_{1},P_{2},P_{3}}, D = {K_{t}

Original language | English |
---|---|

Pages (from-to) | 235-256 |

Number of pages | 22 |

Journal | Ars Combinatoria |

Volume | 63 |

Publication status | Published - Apr 2002 |

### Fingerprint

### ASJC Scopus subject areas

- Mathematics(all)

### Cite this

**Structural domination of graphs.** / Bacsó, Gábor; Tuza, Z.

Research output: Contribution to journal › Article

}

TY - JOUR

T1 - Structural domination of graphs

AU - Bacsó, Gábor

AU - Tuza, Z.

PY - 2002/4

Y1 - 2002/4

N2 - In a graph G = (V, E), a. set S of vertices (as well as the subgraph induced by S) is said to be dominating if every vertex in V/S has at least one neighbor in S. For a given class D of connected graphs, it is an interesting problem to characterize the class Dom(D) of graphs G such that each connected induced subgraph of G contains a dominating subgraph belonging to D. Here we determine Dom(D) for D = {P1,P2,P3}, D = {Kt

AB - In a graph G = (V, E), a. set S of vertices (as well as the subgraph induced by S) is said to be dominating if every vertex in V/S has at least one neighbor in S. For a given class D of connected graphs, it is an interesting problem to characterize the class Dom(D) of graphs G such that each connected induced subgraph of G contains a dominating subgraph belonging to D. Here we determine Dom(D) for D = {P1,P2,P3}, D = {Kt

UR - http://www.scopus.com/inward/record.url?scp=0142138259&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0142138259&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:0142138259

VL - 63

SP - 235

EP - 256

JO - Ars Combinatoria

JF - Ars Combinatoria

SN - 0381-7032

ER -