Contents

Journal of Combinatorial Mathematics and Combinatorial Computing

  • Research article

OO-Irredundance and Maximum Degree in Paths and Trees

E.J. Cockayne1, S. Finbowtand2, J.S. Swarts1
1Department of Mathematics, University of Victoria, PO Box 3045, Victoria, BC, Canada V8W 3P4
2Department of Mathematics, Statistics and Computer Science, PO Box 5000, Antigonish, NS, Canada B2G 2W5
  • Published: 31/05/2010

Abstract

A vertex set \( X \) of a simple graph is called OO-irredundant if for each \( v \in X \), \( N(v) – N(X – \{v\}) \neq \emptyset \). Basic results for maximal OO-irredundant sets of a graph are obtained.

Keywords: OO-irredundance, irredundance
Citation
E.J. Cockayne, S. Finbowtand, J.S. Swarts. OO-Irredundance and Maximum Degree in Paths and Trees[J], Journal of Combinatorial Mathematics and Combinatorial Computing, Volume 073. 223-236. .