Search
Close this search box.

Contents

Journal of Combinatorial Mathematics and Combinatorial Computing

  • Research article

What Makes An Irredundant Set Maximal?

E.J. Cockayne1, P.J.P. Grobler2, S.T. Hedetniemi 3, A.A. McRae 4
1 Department of Mathematics University of Victoria P.O. Box 3045 Victoria BC Canada V8W 3P4
2Department of Mathematics, Applied Mathematics and Astronomy University of South Africa P.O. Box 392 Pretoria, 0001 South Africa
3Department of Computer Science Clemson University Clemson, South Carolina USA 29634-1906
4Department of Computer Science Appalachian State University Boone, North Carolina USA 28608
  • Published: 31/10/1997

Abstract

Two closely related types of vertex subsets of a graph, namely external redundant sets and weak external redundant sets, together with associated parameters, are discussed. Both types may be used to characterize those irredundant subsets of a graph which are maximal.

Information
Guidelines
CP Initiatives
Follow CP
Facebook Twitter Linkedin
1970-2024 CP (Manitoba, Canada) unless otherwise stated.
Citation
E.J. Cockayne, P.J.P. Grobler, S.T. Hedetniemi , A.A. McRae . What Makes An Irredundant Set Maximal?[J], Journal of Combinatorial Mathematics and Combinatorial Computing, Volume 025. 213-223. DOI: .