{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T16:39:35Z","timestamp":1740155975311,"version":"3.37.3"},"reference-count":16,"publisher":"World Scientific Pub Co Pte Ltd","issue":"01","funder":[{"DOI":"10.13039\/501100004541","name":"Ministry of Human Resource Development","doi-asserted-by":"publisher","award":["F. No. 5-6\/2013 -TS-VII"],"award-info":[{"award-number":["F. No. 5-6\/2013 -TS-VII"]}],"id":[{"id":"10.13039\/501100004541","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2021,2]]},"abstract":"<jats:p> Domination is an emerging field in graph theory and many domination parameters were introduced in the meanwhile for different real time situations. Minimum domination number of a graph can be identified by converting the problem into linear programming problem (LPP). In this paper, LPP formulation for strong domination number, restrained domination number and strong restrained domination were developed. MATLAB program was coded to find the values of these parameters. The chain relations among these parameters are tried in four different types of network topologies. Simulation for these four parameters under four network topologies were conducted and it was noticed that in three network types, [Formula: see text] whereas, in the other one, [Formula: see text]. An improved upper bound for restrained domination number was approximated by using the probabilistic method. <\/jats:p>","DOI":"10.1142\/s1793830920500962","type":"journal-article","created":{"date-parts":[[2020,7,18]],"date-time":"2020-07-18T01:57:33Z","timestamp":1595037453000},"page":"2050096","source":"Crossref","is-referenced-by-count":5,"title":["Linear programming approach for various domination parameters"],"prefix":"10.1142","volume":"13","author":[{"given":"Pandiaraja","family":"Duraisamy","sequence":"first","affiliation":[{"name":"National Centre of Excellence, Thiagarajar college, Madurai 625 009, Tamilnadu, India"}]},{"given":"Shanmugam","family":"Esakkimuthu","sequence":"additional","affiliation":[{"name":"National Centre of Excellence, Thiagarajar college, Madurai 625 009, Tamilnadu, India"}]}],"member":"219","published-online":{"date-parts":[[2020,9,15]]},"reference":[{"issue":"7","key":"S1793830920500962BIB001","first-page":"1334","volume":"11","author":"Brewster R. C.","year":"2013","journal-title":"Cent. Eur. J. Math."},{"issue":"1","key":"S1793830920500962BIB002","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0012-365X(95)00231-K","volume":"161","author":"Sampathkumar E.","year":"1996","journal-title":"Discr. Math."},{"issue":"3","key":"S1793830920500962BIB003","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/0166-218X(90)90065-K","volume":"27","author":"Cheston G. A.","year":"1990","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"S1793830920500962BIB004","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/S0166-218X(03)00195-1","volume":"136","author":"Fang Q.","year":"2004","journal-title":"Discrete Appl. Math."},{"issue":"4","key":"S1793830920500962BIB005","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1016\/0167-6377(82)90015-3","volume":"1","author":"Farber M.","year":"1982","journal-title":"Oper. Res. Lett."},{"issue":"2","key":"S1793830920500962BIB006","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/0166-218X(84)90061-1","volume":"7","author":"Farber M.","year":"1984","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"S1793830920500962BIB007","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1137\/S0895480191217806","volume":"7","author":"Fisher D. C.","year":"1994","journal-title":"SIAM J. Discrete Math."},{"issue":"1","key":"S1793830920500962BIB008","first-page":"61","volume":"199","author":"Goddard W.","year":"1994","journal-title":"Discrete Math."},{"key":"S1793830920500962BIB009","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/j.disopt.2016.12.002","volume":"23","author":"Henning M. A.","year":"2017","journal-title":"Discrete Optim."},{"key":"S1793830920500962BIB010","first-page":"133","volume":"1","author":"Johannes H.","year":"1993","journal-title":"Austral. J. Combin."},{"issue":"3","key":"S1793830920500962BIB011","doi-asserted-by":"crossref","first-page":"608","DOI":"10.1007\/s10878-012-9482-y","volume":"26","author":"Liu C. H.","year":"2013","journal-title":"J. Combin. Optim."},{"key":"S1793830920500962BIB012","doi-asserted-by":"crossref","first-page":"230","DOI":"10.1145\/1089803.1089991","volume-title":"Proc. 2nd ACM Int. Workshop on Performance Evaluation of Wireless Ad Hoc, Sensor, and Ubiquitous Networks","author":"Mnif K.","year":"2005"},{"issue":"14","key":"S1793830920500962BIB013","first-page":"365","volume":"3","author":"Nieminen J.","year":"1974","journal-title":"Appl. Math."},{"key":"S1793830920500962BIB014","first-page":"8","volume":"187","author":"Rubalcaba R. R.","year":"2007","journal-title":"Congr. Numer."},{"key":"S1793830920500962BIB015","first-page":"28","volume-title":"Proc. 8th ACM Int. Symp. Modeling, Analysis and Simulation of Wireless and Mobile Systems","author":"Yuan D.","year":"2005"},{"issue":"5","key":"S1793830920500962BIB016","doi-asserted-by":"crossref","first-page":"755","DOI":"10.1007\/s00373-010-0992-z","volume":"27","author":"Zverovich V.","year":"2011","journal-title":"Graphs and Combinatorics"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830920500962","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,1,19]],"date-time":"2021-01-19T11:00:12Z","timestamp":1611054012000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1793830920500962"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,9,15]]},"references-count":16,"journal-issue":{"issue":"01","published-print":{"date-parts":[[2021,2]]}},"alternative-id":["10.1142\/S1793830920500962"],"URL":"https:\/\/doi.org\/10.1142\/s1793830920500962","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"type":"print","value":"1793-8309"},{"type":"electronic","value":"1793-8317"}],"subject":[],"published":{"date-parts":[[2020,9,15]]}}}