Search
Close this search box.

Contents

Journal of Combinatorial Mathematics and Combinatorial Computing

  • Research article

Changing and Unchanging the Domination Number of a Graph

Julie Carrington1, Frank Harary2, Teresa W. Haynes3
1Department of Computer Science University of Central Florida Orlando, FL 32816
2Department of Computer Science New Mexico State University Las Cruces, NM 88003
3Department of Computer Science East Tennessee State University Johnson City, TN 37601
  • Published: 30/04/1991

Abstract

A dominating set in a graph \(G\) is a set \(D\) of nodes such that every node of \(G\) is either in \(D\) or is adjacent to some node in \(D\). The domination number \(\alpha(G)\) is the minimum size of a dominating set. The purpose of this paper is to explore the changing or unchanging of \(\alpha(G)\) when either a node is deleted, or an edge is added or deleted.

Information
Guidelines
CP Initiatives
Follow CP
Facebook Twitter Linkedin
1970-2024 CP (Manitoba, Canada) unless otherwise stated.
Citation
Julie Carrington, Frank Harary, Teresa W. Haynes. Changing and Unchanging the Domination Number of a Graph[J], Journal of Combinatorial Mathematics and Combinatorial Computing, Volume 009. 57-63. DOI: .