• DocumentCode
    1173514
  • Title

    A method to determine a minimal dominating set of a graph G_0

  • Author

    Nieminen, Juhani

  • Volume
    21
  • Issue
    1
  • fYear
    1974
  • fDate
    1/1/1974 12:00:00 AM
  • Firstpage
    12
  • Lastpage
    14
  • Abstract
    An operation is defined on a finite connected undirected graph G_{0} without loops and multiple edges, and the use of the operation to generate a minimal dominating set of G_{0} is illustrated. A method to determine a fairly good approximation of a minimum dominating set is constructed.
  • Keywords
    Communication networks; Graph theory; Graph theory and network topology; Circuit synthesis; Circuit theory; Circuits and systems; Communication networks; Frequency; Helium; Minimization; Network synthesis; Polynomials; Solid state circuits;
  • fLanguage
    English
  • Journal_Title
    Circuits and Systems, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0098-4094
  • Type

    jour

  • DOI
    10.1109/TCS.1974.1083808
  • Filename
    1083808
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1173514