{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,15]],"date-time":"2026-04-15T16:25:41Z","timestamp":1776270341272,"version":"3.50.1"},"reference-count":11,"publisher":"World Scientific Pub Co Pte Lt","issue":"06","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2008,12]]},"abstract":"<jats:p> The matching preclusion number of a graph is the minimum number of edges whose deletion results in a graph that has neither perfect matchings nor almost-perfect matchings. In this paper, we find this number for the alternating group graphs, Cayley graphs generated by 2-trees and the (n,k)-arrangement graphs. Moreover, we classify all the optimal solutions. <\/jats:p>","DOI":"10.1142\/s0129054108006364","type":"journal-article","created":{"date-parts":[[2009,1,5]],"date-time":"2009-01-05T09:36:29Z","timestamp":1231148189000},"page":"1413-1437","source":"Crossref","is-referenced-by-count":48,"title":["MATCHING PRECLUSION FOR ALTERNATING GROUP GRAPHS AND THEIR GENERALIZATIONS"],"prefix":"10.1142","volume":"19","author":[{"given":"EDDIE","family":"CHENG","sequence":"first","affiliation":[{"name":"Department of Mathematics and Statistics, Oakland University, Rochester, MI 48309, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"LINDA","family":"LESNIAK","sequence":"additional","affiliation":[{"name":"Department of Mathematics and Computer Science, Drew University, Madison, NJ 07940, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"MARC J.","family":"LIPMAN","sequence":"additional","affiliation":[{"name":"College of Arts and Sciences, Indiana University\u2014Purdue University, Fort Wayne, Fort Wayne, IN 46805, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"L\u00c1SZL\u00d3","family":"LIPT\u00c1K","sequence":"additional","affiliation":[{"name":"Department of Mathematics and Statistics, Oakland University, Rochester, MI 48309, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"reference":[{"key":"rf2","doi-asserted-by":"publisher","DOI":"10.1002\/net.20126"},{"key":"rf3","doi-asserted-by":"publisher","DOI":"10.1016\/S0021-9800(69)80120-1"},{"key":"rf4","doi-asserted-by":"publisher","DOI":"10.1112\/S0025579300008500"},{"key":"rf5","first-page":"185","volume":"174","author":"Brigham R. C.","journal-title":"Congressus Numerantium"},{"key":"rf6","author":"Cheng E.","journal-title":"Mathematical and Computer Modelling"},{"key":"rf7","first-page":"107","volume":"59","author":"Cheng E.","journal-title":"Ars Combinatoria"},{"key":"rf8","doi-asserted-by":"publisher","DOI":"10.1002\/net.20187"},{"key":"rf9","first-page":"259","volume":"56","author":"Chiang W. K.","journal-title":"Inform. Proc. Lett."},{"key":"rf10","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(92)90030-Y"},{"key":"rf11","first-page":"39","volume":"53","author":"Hsu H.-C.","journal-title":"IEEE Transactions on Computers"},{"key":"rf12","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230230414"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054108006364","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T00:32:52Z","timestamp":1565137972000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054108006364"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,12]]},"references-count":11,"journal-issue":{"issue":"06","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[2008,12]]}},"alternative-id":["10.1142\/S0129054108006364"],"URL":"https:\/\/doi.org\/10.1142\/s0129054108006364","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,12]]}}}