{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T14:11:25Z","timestamp":1775052685253,"version":"3.50.1"},"reference-count":1,"publisher":"Wiley","issue":"5","license":[{"start":{"date-parts":[[2006,10,11]],"date-time":"2006-10-11T00:00:00Z","timestamp":1160524800000},"content-version":"vor","delay-in-days":5184,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Networks"],"published-print":{"date-parts":[[1992,8]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>The leverage of a set <jats:italic>S<\/jats:italic> of elements (vertices and edges) of a graph <jats:italic>G<\/jats:italic>, with respect to a graphical parameter <jats:italic>P<\/jats:italic>, is the change induced in <jats:italic>P<\/jats:italic> by the removal of <jats:italic>S<\/jats:italic>. We consider the case in which <jats:italic>G<\/jats:italic> is a hypercube and <jats:italic>P<\/jats:italic> is the sum of the distances between vertices. The determination of the minimum leverage of any set of <jats:italic>k<\/jats:italic> edges leads to the question of the existence of a perfect matching in which no two edges lie on a 4\u2010cycle. We give a constructive proof of the existence of such a matching and note additional interesting problems.<\/jats:p>","DOI":"10.1002\/net.3230220502","type":"journal-article","created":{"date-parts":[[2007,5,12]],"date-time":"2007-05-12T12:49:06Z","timestamp":1178974146000},"page":"435-439","source":"Crossref","is-referenced-by-count":2,"title":["On a leverage problem in the hypercube"],"prefix":"10.1002","volume":"22","author":[{"given":"Peter","family":"Hamburger","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Raymond E.","family":"Pippert","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"W.","family":"Douglas Weakley","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2006,10,11]]},"reference":[{"key":"e_1_2_1_2_2","unstructured":"K. S.Bagga L. W.Beineke M. J.Lipman andR. E.Pippert The concept of leverage in network vulnerability.Proceedings of the Sixth International Conference on the Theory and Applications of Graphs.WMU Kalamazoo MI (May1988) to appear."}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fnet.3230220502","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/net.3230220502","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,24]],"date-time":"2023-10-24T01:33:51Z","timestamp":1698111231000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/net.3230220502"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,8]]},"references-count":1,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1992,8]]}},"alternative-id":["10.1002\/net.3230220502"],"URL":"https:\/\/doi.org\/10.1002\/net.3230220502","archive":["Portico"],"relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"value":"0028-3045","type":"print"},{"value":"1097-0037","type":"electronic"}],"subject":[],"published":{"date-parts":[[1992,8]]}}}