NDLTD Global ETD Search
  • Refine Query
  • Source
  • Publication year
  • to
  • Language
  • No language data
  • Tagged with
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.

Search results

Showing 1 to 1 of 1 (0.11 seconds)

Spelling suggestions: "subject:"vertex tricritical domination"" "subject:"vertex multicritical domination""

1

Bicritical Domination

Brigham, Robert C., Haynes, Teresa W., Henning, Michael A., Rall, Douglas F. 06 December 2005 (has links)
A graph G is domination bicritical if the removal of any pair of vertices decreases the domination number. Properties of bicritical graphs are studied. We show that a connected bicritical graph has domination number at least 3, minimum degree at least 3, and edge-connectivity at least 2. Ways of constructing a bicritical graph from smaller bicritical graphs are presented.
bounds
diameter
domination
vertex bicritical domination
vertex critical domination
Mathematics and Statistics

Page generated in 0.113 seconds