{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,4,14]],"date-time":"2023-04-14T12:32:58Z","timestamp":1681475578988},"reference-count":8,"publisher":"World Scientific Pub Co Pte Lt","issue":"01","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2017,2]]},"abstract":"<jats:p> We prove the Boyer\u2019s conjecture for graphs having a perfect matching. That is, if [Formula: see text] is such a graph of order [Formula: see text] then [Formula: see text] We also prove an upper bound for the SIG-dimension of any graph without isolated vertices, along with some other results on SIG-dimension. <\/jats:p>","DOI":"10.1142\/s1793830917500082","type":"journal-article","created":{"date-parts":[[2016,11,23]],"date-time":"2016-11-23T03:13:04Z","timestamp":1479870784000},"page":"1750008","source":"Crossref","is-referenced-by-count":1,"title":["SIG-dimension conjecture proved for graphs having a perfect matching"],"prefix":"10.1142","volume":"09","author":[{"given":"Ramanjit","family":"Kumar","sequence":"first","affiliation":[{"name":"6, Ganga Enclave, Sundar Nagar, Kot Khalsa, Amritsar, Punjab, India"}]},{"given":"Surinder Pal","family":"Singh","sequence":"additional","affiliation":[{"name":"Center for Advanced Study in Mathematics, Department of Mathematics, Panjab University, Chandigarh, India"}]}],"member":"219","published-online":{"date-parts":[[2017,2,6]]},"reference":[{"key":"S1793830917500082BIB001","doi-asserted-by":"publisher","DOI":"10.1016\/S0895-7177(00)00191-6"},{"key":"S1793830917500082BIB002","doi-asserted-by":"publisher","DOI":"10.1007\/s00373-012-1160-4"},{"issue":"1","key":"S1793830917500082BIB003","first-page":"1","volume":"80","author":"Kumar R.","year":"2017","journal-title":"Scientiae Mathematicae Japonicae"},{"key":"S1793830917500082BIB004","doi-asserted-by":"publisher","DOI":"10.1016\/S0895-7177(99)00061-8"},{"key":"S1793830917500082BIB005","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(02)00246-9"},{"key":"S1793830917500082BIB007","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-009-7772-3_7"},{"key":"S1793830917500082BIB008","first-page":"220","volume-title":"Computational Morphology","author":"Toussaint G. T.","year":"1998"},{"issue":"2","key":"S1793830917500082BIB009","first-page":"37","volume":"14","author":"Toussaint G. T.","year":"2014","journal-title":"Int. J. Inf. Techonol. Comput. Sci."}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830917500082","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T09:05:01Z","timestamp":1565082301000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1793830917500082"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,2]]},"references-count":8,"journal-issue":{"issue":"01","published-online":{"date-parts":[[2017,2,6]]},"published-print":{"date-parts":[[2017,2]]}},"alternative-id":["10.1142\/S1793830917500082"],"URL":"https:\/\/doi.org\/10.1142\/s1793830917500082","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"value":"1793-8309","type":"print"},{"value":"1793-8317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,2]]}}}