{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T13:29:03Z","timestamp":1753882143489,"version":"3.41.2"},"reference-count":15,"publisher":"World Scientific Pub Co Pte Ltd","issue":"05","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2023,7]]},"abstract":"<jats:p> Let [Formula: see text] be a graph. A subset [Formula: see text] of [Formula: see text] is called a line-set dominating set (LSD-set) if for each subset [Formula: see text], there exists an edge [Formula: see text] such that the edge-induced subgraph [Formula: see text] is connected. The minimum cardinality of an LSD-set of [Formula: see text] is called the line-set domination number of [Formula: see text] and is denoted by [Formula: see text]. In this paper, we obtain a sharp upper bound on the diameter of [Formula: see text] which has an independent LSD-set and on the diameter of graph [Formula: see text] satisfying [Formula: see text] where [Formula: see text] is the line domination number of [Formula: see text]. <\/jats:p>","DOI":"10.1142\/s1793830922501178","type":"journal-article","created":{"date-parts":[[2022,6,9]],"date-time":"2022-06-09T07:59:12Z","timestamp":1654761552000},"source":"Crossref","is-referenced-by-count":0,"title":["Line-set domination in graphs"],"prefix":"10.1142","volume":"15","author":[{"given":"Purnima","family":"Gupta","sequence":"first","affiliation":[{"name":"Department of Mathematics, Sri Venkateswara College, University of Delhi, Delhi 110021, India"}]},{"given":"Alka","family":"Goyal","sequence":"additional","affiliation":[{"name":"Department of Mathematics, University of Delhi, Delhi 110007, India"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4477-9453","authenticated-orcid":false,"given":"S.","family":"Arumugam","sequence":"additional","affiliation":[{"name":"National Centre for Advanced Research in Discrete Mathematics, Kalasalingam University, Krishnankoil 626126, Tamil Nadu, India"}]}],"member":"219","published-online":{"date-parts":[[2022,7,5]]},"reference":[{"volume-title":"Proc. Nat. Symp. Recent Trends in Mathematics","year":"1996","author":"Acharya B. D.","key":"S1793830922501178BIB001"},{"issue":"2","key":"S1793830922501178BIB002","first-page":"133","volume":"22","author":"Acharya B. D.","year":"1997","journal-title":"J. Combin. Inf. Syst. Sci."},{"key":"S1793830922501178BIB003","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0012-365X(98)00160-5","volume":"195","author":"Acharya B. D.","year":"1999","journal-title":"Discrete Math."},{"issue":"11","key":"S1793830922501178BIB004","first-page":"171","volume":"23","author":"Acharya B. D.","year":"2000","journal-title":"Nat. Acad. Sci. Lett."},{"issue":"2","key":"S1793830922501178BIB005","first-page":"87","volume":"2","author":"Acharya B. D.","year":"2005","journal-title":"AKCE J. Graphs. Combin."},{"key":"S1793830922501178BIB006","volume-title":"Graphs & Digraphs","author":"Chartrand G.","year":"2005","edition":"4"},{"key":"S1793830922501178BIB007","volume-title":"Domination in Graphs: Advanced Topics","volume":"209","author":"Haynes T. W.","year":"1998"},{"key":"S1793830922501178BIB008","volume-title":"Fundamentals of Domination in Graphs","volume":"208","author":"Haynes T. W.","year":"1998"},{"issue":"4","key":"S1793830922501178BIB009","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1007\/BF01788558","volume":"3","author":"Jayaram S. R.","year":"1987","journal-title":"Graphs Combin."},{"issue":"6","key":"S1793830922501178BIB010","doi-asserted-by":"crossref","first-page":"2050072","DOI":"10.1142\/S179383092050072X","volume":"12","author":"Mahmoodi A.","year":"2020","journal-title":"Discrete Math. Algorithms Appl."},{"key":"S1793830922501178BIB011","unstructured":"S. Mitchell and  S. T. Hedetniemi ,  Edge domination in trees, in  Proc. 8th S.E. Conf. Comb. Graph Theory and Computing  (Los Angeles, Baton Rouge,  1977),  pp. 489\u2013509."},{"key":"S1793830922501178BIB012","doi-asserted-by":"publisher","DOI":"10.1142\/S1793830920500688"},{"issue":"7","key":"S1793830922501178BIB013","first-page":"709","volume":"30","author":"Nagaraja Rao I. H.","year":"1999","journal-title":"Indian J. Pure Appl. Math."},{"issue":"4","key":"S1793830922501178BIB014","first-page":"225","volume":"24","author":"Sampathkumar E.","year":"1993","journal-title":"Indian J. Pure Appl. Math."},{"issue":"1","key":"S1793830922501178BIB015","doi-asserted-by":"crossref","first-page":"2050002","DOI":"10.1142\/S1793830920500020","volume":"12","author":"Udupa S.","year":"2020","journal-title":"Discrete Math. Algorithms Appl."}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830922501178","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,23]],"date-time":"2023-05-23T03:20:09Z","timestamp":1684812009000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/10.1142\/S1793830922501178"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,5]]},"references-count":15,"journal-issue":{"issue":"05","published-print":{"date-parts":[[2023,7]]}},"alternative-id":["10.1142\/S1793830922501178"],"URL":"https:\/\/doi.org\/10.1142\/s1793830922501178","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"type":"print","value":"1793-8309"},{"type":"electronic","value":"1793-8317"}],"subject":[],"published":{"date-parts":[[2022,7,5]]},"article-number":"2250117"}}