View in EDS

Bounds on a graph's security number

Saved in:
Bibliographic Details
Title: Bounds on a graph's security number
Authors: Dutton, Ronald D.1 dutton@cs.ucf.edu, Lee, Robert1, Brigham, Robert C.1
Source: Discrete Applied Mathematics. Mar2008, Vol. 156 Issue 5, p695-704. 10p.
Subjects: Graph theory, Algebra, Combinatorics, Topology
Abstract: Abstract: Let be a graph. A set is a defensive alliance if for every . Thus, each vertex of a defensive alliance can, with the aid of its neighbors in S, be defended from attack by its neighbors outside of S. An entire set S is secure if any subset , not just singletons, can be defended from an attack from outside of S, under an appropriate definition of what such a defense implies. The security number of G is the cardinality of a smallest secure set. Bounds on are presented. [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: 30016880
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Bounds on a graph's security number
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Dutton%2C+Ronald+D%2E%22">Dutton, Ronald D.</searchLink><relatesTo>1</relatesTo><i> dutton@cs.ucf.edu</i><br /><searchLink fieldCode="AR" term="%22Lee%2C+Robert%22">Lee, Robert</searchLink><relatesTo>1</relatesTo><br /><searchLink fieldCode="AR" term="%22Brigham%2C+Robert+C%2E%22">Brigham, Robert C.</searchLink><relatesTo>1</relatesTo>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Discrete+Applied+Mathematics%22">Discrete Applied Mathematics</searchLink>. Mar2008, Vol. 156 Issue 5, p695-704. 10p.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Graph+theory%22">Graph theory</searchLink><br /><searchLink fieldCode="DE" term="%22Algebra%22">Algebra</searchLink><br /><searchLink fieldCode="DE" term="%22Combinatorics%22">Combinatorics</searchLink><br /><searchLink fieldCode="DE" term="%22Topology%22">Topology</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: Abstract: Let be a graph. A set is a defensive alliance if for every . Thus, each vertex of a defensive alliance can, with the aid of its neighbors in S, be defended from attack by its neighbors outside of S. An entire set S is secure if any subset , not just singletons, can be defended from an attack from outside of S, under an appropriate definition of what such a defense implies. The security number of G is the cardinality of a smallest secure set. Bounds on are presented. [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=30016880
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1016/j.dam.2007.08.037
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 10
        StartPage: 695
    Subjects:
      – SubjectFull: Graph theory
        Type: general
      – SubjectFull: Algebra
        Type: general
      – SubjectFull: Combinatorics
        Type: general
      – SubjectFull: Topology
        Type: general
    Titles:
      – TitleFull: Bounds on a graph's security number
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Dutton, Ronald D.
      – PersonEntity:
          Name:
            NameFull: Lee, Robert
      – PersonEntity:
          Name:
            NameFull: Brigham, Robert C.
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 03
              Text: Mar2008
              Type: published
              Y: 2008
          Identifiers:
            – Type: issn-print
              Value: 0166218X
          Numbering:
            – Type: volume
              Value: 156
            – Type: issue
              Value: 5
          Titles:
            – TitleFull: Discrete Applied Mathematics
              Type: main
ResultId 1