{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,23]],"date-time":"2024-09-23T03:45:33Z","timestamp":1727063133700},"reference-count":6,"publisher":"Wiley","issue":"6","license":[{"start":{"date-parts":[[2006,10,5]],"date-time":"2006-10-05T00:00:00Z","timestamp":1160006400000},"content-version":"vor","delay-in-days":6152,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Graph Theory"],"published-print":{"date-parts":[[1989,12]]},"abstract":"Abstract<\/jats:title>The domination number \u03b3(G<\/jats:italic>) of a graph G<\/jats:italic> = (V, E<\/jats:italic>) is the minimum cardinality of a subset of V<\/jats:italic> such that every vertex is either in the set or is adjacent to some vertex in the set. We show that if a connected graph G<\/jats:italic> has minimum degree two and is not one of seven exceptional graphs, then \u03b3(G<\/jats:italic>)\u03b3 2\/5|V<\/jats:italic>|. We also characterize those connected graphs with \u03b3(G<\/jats:italic>)\u03b3 2\/5|V<\/jats:italic>|.<\/jats:p>","DOI":"10.1002\/jgt.3190130610","type":"journal-article","created":{"date-parts":[[2007,6,8]],"date-time":"2007-06-08T21:55:32Z","timestamp":1181339732000},"page":"749-762","source":"Crossref","is-referenced-by-count":86,"title":["Domination in graphs with minimum degree two"],"prefix":"10.1002","volume":"13","author":[{"given":"William","family":"McCuaig","sequence":"first","affiliation":[]},{"given":"Bruce","family":"Shepherd","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2006,10,5]]},"reference":[{"key":"e_1_2_1_2_2","unstructured":"D.Applegate private communication."},{"key":"e_1_2_1_3_2","unstructured":"B.Gamble private communication."},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1090\/coll\/038"},{"issue":"2","key":"e_1_2_1_5_2","article-title":"Sur le nombre d'absorption d'un graphe simple","volume":"17","author":"Payan C.","year":"1975","journal-title":"Cahier du C.E.R.O."},{"key":"e_1_2_1_6_2","unstructured":"C.Payan Sur quelques probl\u00e8mes de couverture et de couplage en combinatoire. Th\u00e8se Grenoble (1977)."},{"key":"e_1_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190090414"}],"container-title":["Journal of Graph Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fjgt.3190130610","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/jgt.3190130610","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,22]],"date-time":"2023-10-22T02:57:18Z","timestamp":1697943438000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/jgt.3190130610"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,12]]},"references-count":6,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1989,12]]}},"alternative-id":["10.1002\/jgt.3190130610"],"URL":"https:\/\/doi.org\/10.1002\/jgt.3190130610","archive":["Portico"],"relation":{},"ISSN":["0364-9024","1097-0118"],"issn-type":[{"value":"0364-9024","type":"print"},{"value":"1097-0118","type":"electronic"}],"subject":[],"published":{"date-parts":[[1989,12]]}}}