WELL IRREDUNDANT GRAPHS

Authors
TOPP J VESTERGAARD PD
Citation
J. Topp et Pd. Vestergaard, WELL IRREDUNDANT GRAPHS, Discrete applied mathematics, 63(3), 1995, pp. 267-276
Citations number
13
Categorie Soggetti
Mathematics,Mathematics
Journal title
Discrete applied mathematics → ACNP
Volume
63
Issue
3
Year of publication
1995
Pages
267 - 276
Database
ISI
SICI code
Abstract
A vertex x in a subset X of vertices of a graph is redundant if its cl osed neighbourhood is contained in the union of closed neighbourhoods of vertices of X - {x}. This paper describes the structure of bipartit e graphs, chordal graphs and graphs of girth at least five in which ev ery maximal set of vertices having no redundancies is maximum.