Search
Close this search box.

Contents

Journal of Combinatorial Mathematics and Combinatorial Computing

  • Research article

The Effects of Graph Modifications on Edge Independence and Edge Covering Numbers

Linda M. Lawson1, Teresa W. Haynes2
1Department of Mathematics East Tennessee State University Johnson City, TN 37614
2Department of Computer Science East Tennessee State University Johnson City, TN 37614
  • Published: 31/10/1992

Abstract

We consider the changing and unchanging of the edge covering and edge independence numbers of a graph when the graph is modified by deleting a node, deleting an edge, or adding an edge. In this paper, we present characterizations for the graphs in each of these classes and some relationships among them.

Information
Guidelines
CP Initiatives
Follow CP
Facebook X-twitter Linkedin
1970-2024 CP (Manitoba, Canada) unless otherwise stated.
Citation
Linda M. Lawson, Teresa W. Haynes. The Effects of Graph Modifications on Edge Independence and Edge Covering Numbers[J], Journal of Combinatorial Mathematics and Combinatorial Computing, Volume 012. 129-140. DOI: .