{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T14:12:37Z","timestamp":1777644757270,"version":"3.51.4"},"reference-count":0,"publisher":"SAGE Publications","issue":"3","license":[{"start":{"date-parts":[[2017,4,6]],"date-time":"2017-04-06T00:00:00Z","timestamp":1491436800000},"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":[[2017,4,6]]},"abstract":"<jats:p>\n                    A vertex cover of a graph G = ( V, E) is a set X \u2282 V such that each edge of G is incident to at least one vertex of X. The vertex cover number \u03c4( G) is the minimum cardinality of a vertex cover of G. A dominating set D \u2286 V is a weakly connected dominating set of G if the subgraph G[ D]\n                    <jats:sub>w<\/jats:sub>\n                    = ( N[ D], E\n                    <jats:sub>w<\/jats:sub>\n                    ) weakly induced by D, is connected, where E\n                    <jats:sub>w<\/jats:sub>\n                    is the set of all edges having at least one vertex in D. The weakly connected domination number \u03b3\n                    <jats:sub>w<\/jats:sub>\n                    ( G) of G is the minimum cardinality among all weakly connected dominating sets of G. In this article we characterize the graphs where \u03b3\n                    <jats:sub>w<\/jats:sub>\n                    ( G) = \u03c4( G). In particular, we focus our attention on bipartite graphs, regular graphs, unicyclic graphs, block graphs and corona graphs.\n                  <\/jats:p>","DOI":"10.3233\/fi-2017-1520","type":"journal-article","created":{"date-parts":[[2017,4,7]],"date-time":"2017-04-07T11:40:19Z","timestamp":1491565219000},"page":"273-287","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":0,"title":["Similarities and Differences Between the Vertex Cover Number and the Weakly Connected Domination Number of a Graph"],"prefix":"10.1177","volume":"152","author":[{"given":"Magdalena","family":"Lema\u0144ska","sequence":"first","affiliation":[{"name":"Department of Technical Physics and Applied Mathematics, Gdansk University of Technology, ul. Narutowicza 11\/12 80-233 Gdansk, Poland."}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Juan Alberto","family":"Rodr\u00edguez-Vel\u00e1zquez","sequence":"additional","affiliation":[{"name":"Departament d\u2019Enginyeria Inform\u00e0tica i Matem\u00e0tiques, Universitat Rovira i Virgili, Av. Pa\u00efsos Catalans 26, 43007 Tarragona, Spain."}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rolando","family":"Trujillo-Rasua","sequence":"additional","affiliation":[{"name":"Interdisciplinary Centre for Security, Reliability and Trust (SnT), University of Luxembourg, Luxemburg."}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","published-online":{"date-parts":[[2017,4,6]]},"container-title":["Fundamenta Informaticae"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/FI-2017-1520","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/FI-2017-1520","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T06:30:16Z","timestamp":1777444216000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.3233\/FI-2017-1520"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,4,6]]},"references-count":0,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2017,4,6]]}},"alternative-id":["10.3233\/FI-2017-1520"],"URL":"https:\/\/doi.org\/10.3233\/fi-2017-1520","relation":{},"ISSN":["0169-2968","1875-8681"],"issn-type":[{"value":"0169-2968","type":"print"},{"value":"1875-8681","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,4,6]]}}}