View in EDS

Global secure sets of grid-like graphs

Saved in:
Bibliographic Details
Title: Global secure sets of grid-like graphs
Authors: Ho, Yiu Yu yiuyuho@gmail.com, Dutton, Ronald dutton@cs.ucf.edu
Source: Discrete Applied Mathematics. Mar2011, Vol. 159 Issue 6, p490-496. 7p.
Subjects: Set theory, Graph theory, Dominating set, Paths & cycles in graph theory, Security management
Abstract: Abstract: Let be a graph and . The set is a secure set if , and is a global secure set if is a secure set and a dominating set. The cardinality of a minimum global secure set of is the global security number of , denoted . The sets studied in this paper are different from secure dominating sets studied in Cockayne et al. (2003) , Grobler and Mynhardt (2009) , or Klostermeyer and Mynhardt (2008) , which are also denoted by . In this paper, we provide results on the global security numbers of paths, cycles and their Cartesian products. [Copyright &y& Elsevier]
Copyright of Discrete Applied Mathematics is the property of Elsevier B.V. and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
FullText Text:
  Availability: 0
Header DbId: egs
DbLabel: Engineering Source
An: 57680963
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Global secure sets of grid-like graphs
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Ho%2C+Yiu+Yu%22">Ho, Yiu Yu</searchLink><i> yiuyuho@gmail.com</i><br /><searchLink fieldCode="AR" term="%22Dutton%2C+Ronald%22">Dutton, Ronald</searchLink><i> dutton@cs.ucf.edu</i>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Discrete+Applied+Mathematics%22">Discrete Applied Mathematics</searchLink>. Mar2011, Vol. 159 Issue 6, p490-496. 7p.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Set+theory%22">Set theory</searchLink><br /><searchLink fieldCode="DE" term="%22Graph+theory%22">Graph theory</searchLink><br /><searchLink fieldCode="DE" term="%22Dominating+set%22">Dominating set</searchLink><br /><searchLink fieldCode="DE" term="%22Paths+%26+cycles+in+graph+theory%22">Paths & cycles in graph theory</searchLink><br /><searchLink fieldCode="DE" term="%22Security+management%22">Security management</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: Abstract: Let be a graph and . The set is a secure set if , and is a global secure set if is a secure set and a dominating set. The cardinality of a minimum global secure set of is the global security number of , denoted . The sets studied in this paper are different from secure dominating sets studied in Cockayne et al. (2003) , Grobler and Mynhardt (2009) , or Klostermeyer and Mynhardt (2008) , which are also denoted by . In this paper, we provide results on the global security numbers of paths, cycles and their Cartesian products. [Copyright &y& Elsevier]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>Copyright of Discrete Applied Mathematics is the property of Elsevier B.V. and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.)
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=57680963
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1016/j.dam.2010.12.013
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 7
        StartPage: 490
    Subjects:
      – SubjectFull: Set theory
        Type: general
      – SubjectFull: Graph theory
        Type: general
      – SubjectFull: Dominating set
        Type: general
      – SubjectFull: Paths & cycles in graph theory
        Type: general
      – SubjectFull: Security management
        Type: general
    Titles:
      – TitleFull: Global secure sets of grid-like graphs
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Ho, Yiu Yu
      – PersonEntity:
          Name:
            NameFull: Dutton, Ronald
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 28
              M: 03
              Text: Mar2011
              Type: published
              Y: 2011
          Identifiers:
            – Type: issn-print
              Value: 0166218X
          Numbering:
            – Type: volume
              Value: 159
            – Type: issue
              Value: 6
          Titles:
            – TitleFull: Discrete Applied Mathematics
              Type: main
ResultId 1