Structural domination of graphs

Gábor Bacsó, Zsolt 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 1 2002

ASJC Scopus subject areas

  • Mathematics(all)

Fingerprint Dive into the research topics of 'Structural domination of graphs'. Together they form a unique fingerprint.

  • Cite this