Well irredundant graphs
type: Item
instance of: scholarly article
title: Well irredundant graphs
zbMATH Open document ID: 0846.05051
DOI: 10.1016/0166-218X(94)00073-9
author: Jerzy Topp
author: Preben Dahl Vestergaard
published in: Discrete Applied Mathematics
publication date: 1996-07-07T00:00:00Z
Mathematics Subject Classification ID: 05C35
zbMATH DE Number: 897349
zbMATH Keywords: well irredundant graphs
zbMATH Keywords: dominating
zbMATH Keywords: irredundance numbers
zbMATH Keywords: closed neighbourhood
zbMATH Keywords: bipartite graphs
zbMATH Keywords: chordal graphs
MaRDI profile type: Publication
cites work: Graph-theoretic parameters concerning domination, independence, and irredundance
cites work: Q3818315
cites work: Towards a theory of domination in graphs
cites work: Gallai theorems for graphs, hypergraphs, and set systems
cites work: Properties of Hereditary Hypergraphs and Middle Graphs
cites work: Q3797234
cites work: On graphs having domination number half their order
cites work: Q3791195
cites work: Q3933018
cites work: Two Bounds for the Domination Number of a Graph
cites work: Some covering concepts in graphs
cites work: WELL-COVERED GRAPHS: A SURVEY
cites work: Well covered simplicial, chordal, and circular arc graphs
description: scientific article; zbMATH DE number 897349