{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T14:26:09Z","timestamp":1777645569456,"version":"3.51.4"},"reference-count":0,"publisher":"SAGE Publications","issue":"3","license":[{"start":{"date-parts":[[2021,11,27]],"date-time":"2021-11-27T00:00:00Z","timestamp":1637971200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["Fundamenta Informaticae"],"published-print":{"date-parts":[[2021,11,27]]},"abstract":"<jats:p>A zero forcing set is a set S of vertices of a graph G, called forced vertices of G, which are able to force the entire graph by applying the following process iteratively: At any particular instance of time, if any forced vertex has a unique unforced neighbor, it forces that neighbor. In this paper, we introduce a variant of zero forcing set that induces independent edges and name it as edge-forcing set. The minimum cardinality of an edge-forcing set is called the edge-forcing number. We prove that the edge-forcing problem of determining the edge-forcing number is NP-complete. Further, we study the edge-forcing number of butterfly networks. We obtain a lower bound on the edge-forcing number of butterfly networks and prove that this bound is tight for butterfly networks of dimensions 2, 3, 4 and 5 and obtain an upper bound for the higher dimensions.<\/jats:p>","DOI":"10.3233\/fi-2021-2074","type":"journal-article","created":{"date-parts":[[2021,11,30]],"date-time":"2021-11-30T15:01:13Z","timestamp":1638284473000},"page":"285-299","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":2,"title":["Edge Forcing in Butterfly Networks"],"prefix":"10.1177","volume":"182","author":[{"given":"G.","family":"Jessy Sujana","sequence":"first","affiliation":[{"name":"Department of Computer Science and Engineering, Sri Sivasubramaniya Nadar College of Engineering, Chennai, 603 110, India."}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"T.M.","family":"Rajalaxmi","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Sri Sivasubramaniya Nadar College of Engineering, Chennai, 603 110, India."}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Indra","family":"Rajasingh","sequence":"additional","affiliation":[{"name":"School of Advanced Sciences, Vellore Institute of Technology, Chennai, 600 127, India."}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R.","family":"Sundara Rajan","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Hindustan Institute of Technology and Science, Chennai, 603 103, India."}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","published-online":{"date-parts":[[2021,11,27]]},"container-title":["Fundamenta Informaticae"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/FI-2021-2074","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/FI-2021-2074","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T06:32:35Z","timestamp":1777444355000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.3233\/FI-2021-2074"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,11,27]]},"references-count":0,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2021,11,27]]}},"alternative-id":["10.3233\/FI-2021-2074"],"URL":"https:\/\/doi.org\/10.3233\/fi-2021-2074","relation":{},"ISSN":["0169-2968","1875-8681"],"issn-type":[{"value":"0169-2968","type":"print"},{"value":"1875-8681","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,11,27]]}}}