{"title":"A linear programming method for exponential\n domination","authors":"Michael Dairyko, Michael Young","doi":"10.1090/conm/759/15273","DOIUrl":null,"url":null,"abstract":"For a graph G, the set D ⊆V (G) is a porous exponential dominating set if 1 ≤ ∑ d∈D (2) 1−dist(d ,v) for every v ∈ V (G), where dist(d , v) denotes the length of the shortest d v path. The porous exponential dominating number of G, denoted γe (G), is the minimum cardinality of a porous exponential dominating set. For any graph G, a technique is derived to determine a lower bound for γe (G). Specifically for a grid graph H , linear programing is used to sharpen bound found through the lower bound technique. Lower and upper bounds are determined for the porous exponential domination number of the King Grid Kn , the Slant Grid Sn , and the n-dimensional hypercube Qn . AMS 2010 Subject Classification: Primary 05C69; Secondary 90C05","PeriodicalId":351002,"journal":{"name":"The Golden Anniversary Celebration of the\n National Association of Mathematicians","volume":"81 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-01-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"The Golden Anniversary Celebration of the\n National Association of Mathematicians","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1090/conm/759/15273","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
For a graph G, the set D ⊆V (G) is a porous exponential dominating set if 1 ≤ ∑ d∈D (2) 1−dist(d ,v) for every v ∈ V (G), where dist(d , v) denotes the length of the shortest d v path. The porous exponential dominating number of G, denoted γe (G), is the minimum cardinality of a porous exponential dominating set. For any graph G, a technique is derived to determine a lower bound for γe (G). Specifically for a grid graph H , linear programing is used to sharpen bound found through the lower bound technique. Lower and upper bounds are determined for the porous exponential domination number of the King Grid Kn , the Slant Grid Sn , and the n-dimensional hypercube Qn . AMS 2010 Subject Classification: Primary 05C69; Secondary 90C05