Structural domination of graphs

Gábor Bacsó, Z. Tuza

Research output: Contribution to journalArticle

6 Citations (Scopus)

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 = {P1,P2,P3}, D = {Kt

Original languageEnglish
Pages (from-to)235-256
Number of pages22
JournalArs Combinatoria
Volume63
Publication statusPublished - Apr 2002

Fingerprint

Induced Subgraph
Domination
Graph in graph theory
Connected graph
Subgraph
Vertex of a graph
Class

ASJC Scopus subject areas

  • Mathematics(all)

Cite this

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

In: Ars Combinatoria, Vol. 63, 04.2002, p. 235-256.

Research output: Contribution to journalArticle

Bacsó, G & Tuza, Z 2002, 'Structural domination of graphs', Ars Combinatoria, vol. 63, pp. 235-256.
Bacsó, Gábor ; Tuza, Z. / Structural domination of graphs. In: Ars Combinatoria. 2002 ; Vol. 63. pp. 235-256.
@article{ed98e6af12b54464b957222f6af26177,
title = "Structural domination of graphs",
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 = {P1,P2,P3}, D = {Kt",
author = "G{\'a}bor Bacs{\'o} and Z. Tuza",
year = "2002",
month = "4",
language = "English",
volume = "63",
pages = "235--256",
journal = "Ars Combinatoria",
issn = "0381-7032",
publisher = "Charles Babbage Research Centre",

}

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 -