{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,3]],"date-time":"2024-09-03T06:35:09Z","timestamp":1725345309563},"reference-count":20,"publisher":"World Scientific Pub Co Pte Lt","issue":"03","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2020,6]]},"abstract":"<jats:p>The minimum edge version of metric basis is the smallest set [Formula: see text] of edges in a connected graph [Formula: see text] such that for every pair of edges [Formula: see text] [Formula: see text][Formula: see text] there exists an edge [Formula: see text] [Formula: see text][Formula: see text] for which [Formula: see text] [Formula: see text] [Formula: see text] holds. In this paper, the families of grid graphs and generalized prism graphs have been studied for edge version of metric dimension. Edge version of metric dimension is found to be constant for both families of graphs.<\/jats:p>","DOI":"10.1142\/s1793830920500378","type":"journal-article","created":{"date-parts":[[2020,3,2]],"date-time":"2020-03-02T03:53:05Z","timestamp":1583121185000},"page":"2050037","source":"Crossref","is-referenced-by-count":3,"title":["Edge version of metric dimension for the families of grid graphs and generalized prism graphs"],"prefix":"10.1142","volume":"12","author":[{"given":"Ruby","family":"Nasir","sequence":"first","affiliation":[{"name":"Department of Mathematics, University of Management and Technology, Johar Town, Lahore 54782, Pakistan"}]},{"given":"Zohaib","family":"Zahid","sequence":"additional","affiliation":[{"name":"Department of Mathematics, University of Management and Technology, Johar Town, Lahore 54782, Pakistan"}]},{"given":"Sohail","family":"Zafar","sequence":"additional","affiliation":[{"name":"Department of Mathematics, University of Management and Technology, Johar Town, Lahore 54782, Pakistan"}]}],"member":"219","published-online":{"date-parts":[[2020,6,22]]},"reference":[{"key":"S1793830920500378BIB001","doi-asserted-by":"publisher","DOI":"10.1112\/blms\/bdq096"},{"key":"S1793830920500378BIB002","doi-asserted-by":"publisher","DOI":"10.1137\/050641867"},{"key":"S1793830920500378BIB003","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(00)00198-0"},{"key":"S1793830920500378BIB004","first-page":"47","volume":"160","author":"Chartrand G.","year":"2003","journal-title":"Congressus Numerantium."},{"issue":"3","key":"S1793830920500378BIB005","doi-asserted-by":"crossref","first-page":"467","DOI":"10.21136\/MB.2014.143937","volume":"139","author":"Eroh L.","year":"2014","journal-title":"Math. Bohem."},{"key":"S1793830920500378BIB006","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2012.10.018"},{"key":"S1793830920500378BIB007","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey M. R.","year":"1979"},{"key":"S1793830920500378BIB008","first-page":"49","volume":"31","author":"Gutman I.","year":"1996","journal-title":"Graph Theory Notes NY"},{"key":"S1793830920500378BIB009","first-page":"14","volume":"33","author":"Gutman I.","year":"1997","journal-title":"Graph Theory Notes NY"},{"key":"S1793830920500378BIB010","first-page":"191","volume":"2","author":"Harary F.","year":"1976","journal-title":"Ars Combin."},{"issue":"2","key":"S1793830920500378BIB011","first-page":"31","volume":"76","author":"Imran M.","year":"2014","journal-title":"U.P.B. Sci. Bull., A"},{"key":"S1793830920500378BIB012","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2018.05.052"},{"key":"S1793830920500378BIB013","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(95)00106-2"},{"issue":"1","key":"S1793830920500378BIB014","first-page":"79","volume":"11","author":"Khulli V. R.","year":"2016","journal-title":"Ann. Pure Appl. Math."},{"issue":"6","key":"S1793830920500378BIB015","first-page":"1","volume":"243","author":"Liu J. B.","year":"2018","journal-title":"Mathematics"},{"key":"S1793830920500378BIB016","first-page":"143","volume":"147","author":"Nasir R.","year":"2019","journal-title":"Ars Combin."},{"key":"S1793830920500378BIB017","doi-asserted-by":"publisher","DOI":"10.2298\/PIM0999039R"},{"key":"S1793830920500378BIB018","first-page":"549","volume":"14","author":"Slater P. J.","year":"1975","journal-title":"Congressus Numerantium."},{"key":"S1793830920500378BIB019","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0071635"},{"key":"S1793830920500378BIB020","doi-asserted-by":"publisher","DOI":"10.12785\/amis\/090109"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830920500378","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,3,1]],"date-time":"2021-03-01T21:56:36Z","timestamp":1614635796000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1793830920500378"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6]]},"references-count":20,"journal-issue":{"issue":"03","published-print":{"date-parts":[[2020,6]]}},"alternative-id":["10.1142\/S1793830920500378"],"URL":"https:\/\/doi.org\/10.1142\/s1793830920500378","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"value":"1793-8309","type":"print"},{"value":"1793-8317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,6]]}}}