Dominating cliques in P5-free graphs

G. Bacsó, Z. Tuza

Research output: Contribution to journalArticle

80 Citations (Scopus)

Abstract

All induced connected subgraphs of a graph G contain a dominating set of pair-wise adjacent vertices if and only if there is no induced subgraph isomorphic to a path or a cycle of five vertices in G. Moreover, the problem of finding any given type of connected dominating sets in all members of a class G of graphs can be reduced to the graphs G∈G that have a cut-vertex or do not contain any cutset S dominated by some s∈S.

Original languageEnglish
Pages (from-to)303-308
Number of pages6
JournalPeriodica Mathematica Hungarica
Volume21
Issue number4
DOIs
Publication statusPublished - Dec 1990

Fingerprint

Clique
Graph in graph theory
Cut Vertex
Connected Dominating Set
Cutset
Dominating Set
Induced Subgraph
Subgraph
Adjacent
Isomorphic
If and only if
Cycle
Path

Keywords

  • AMS subject classification (1985/85): Primary

ASJC Scopus subject areas

  • Mathematics(all)

Cite this

Dominating cliques in P5-free graphs. / Bacsó, G.; Tuza, Z.

In: Periodica Mathematica Hungarica, Vol. 21, No. 4, 12.1990, p. 303-308.

Research output: Contribution to journalArticle

Bacsó, G. ; Tuza, Z. / Dominating cliques in P5-free graphs. In: Periodica Mathematica Hungarica. 1990 ; Vol. 21, No. 4. pp. 303-308.
@article{7c29945fda6345338eacf538341d43e3,
title = "Dominating cliques in P5-free graphs",
abstract = "All induced connected subgraphs of a graph G contain a dominating set of pair-wise adjacent vertices if and only if there is no induced subgraph isomorphic to a path or a cycle of five vertices in G. Moreover, the problem of finding any given type of connected dominating sets in all members of a class G of graphs can be reduced to the graphs G∈G that have a cut-vertex or do not contain any cutset S dominated by some s∈S.",
keywords = "AMS subject classification (1985/85): Primary",
author = "G. Bacs{\'o} and Z. Tuza",
year = "1990",
month = "12",
doi = "10.1007/BF02352694",
language = "English",
volume = "21",
pages = "303--308",
journal = "Periodica Mathematica Hungarica",
issn = "0031-5303",
publisher = "Springer Netherlands",
number = "4",

}

TY - JOUR

T1 - Dominating cliques in P5-free graphs

AU - Bacsó, G.

AU - Tuza, Z.

PY - 1990/12

Y1 - 1990/12

N2 - All induced connected subgraphs of a graph G contain a dominating set of pair-wise adjacent vertices if and only if there is no induced subgraph isomorphic to a path or a cycle of five vertices in G. Moreover, the problem of finding any given type of connected dominating sets in all members of a class G of graphs can be reduced to the graphs G∈G that have a cut-vertex or do not contain any cutset S dominated by some s∈S.

AB - All induced connected subgraphs of a graph G contain a dominating set of pair-wise adjacent vertices if and only if there is no induced subgraph isomorphic to a path or a cycle of five vertices in G. Moreover, the problem of finding any given type of connected dominating sets in all members of a class G of graphs can be reduced to the graphs G∈G that have a cut-vertex or do not contain any cutset S dominated by some s∈S.

KW - AMS subject classification (1985/85): Primary

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

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

U2 - 10.1007/BF02352694

DO - 10.1007/BF02352694

M3 - Article

AN - SCOPUS:0038846459

VL - 21

SP - 303

EP - 308

JO - Periodica Mathematica Hungarica

JF - Periodica Mathematica Hungarica

SN - 0031-5303

IS - 4

ER -