{"@context":["https://w3id.org/fdo/context/v1",{"schema":"https://schema.org/","prov":"http://www.w3.org/ns/prov#","fdo":"https://w3id.org/fdo/vocabulary/"}],"@id":"https://fdo.portal.mardi4nfdi.de/fdo/Q6133670","@type":"DigitalObject","kernel":{"@id":"https://fdo.portal.mardi4nfdi.de/fdo/Q6133670","digitalObjectType":"https://schema.org/ScholarlyArticle","primaryIdentifier":"mardi:Q6133670","kernelVersion":"v1","immutable":true,"modified":"2026-02-17T17:19:22Z"},"profile":{"@context":"https://schema.org","@type":"ScholarlyArticle","@id":"https://portal.mardi4nfdi.de/entity/Q6133670","name":"Dominating sets inducing large component in graphs with minimum degree two","headline":"Dominating sets inducing large component in graphs with minimum degree two","description":"scientific article; zbMATH DE number 7730256","url":"https://portal.mardi4nfdi.de/entity/Q6133670","datePublished":"2023-08-21","author":[{"@id":"https://portal.mardi4nfdi.de/entity/Q6133669"},{"@id":"https://portal.mardi4nfdi.de/entity/Q244910"}],"publisher":[{"@id":"https://portal.mardi4nfdi.de/entity/Q185060"}],"identifier":{"@type":"PropertyValue","propertyID":"doi","value":"10.1007/S00373-023-02687-Z","url":"https://doi.org/10.1007/S00373-023-02687-Z"},"sameAs":["https://doi.org/10.1007/S00373-023-02687-Z"],"comment":"A dominating set \\(S\\) of a graph \\(G=(V,E)\\) is called a \\(k\\)-component dominating set if each connected component in the induced subgraph \\(G[S]\\) has order at least \\(k\\). The minimum cardinality of a \\(k\\)-component dominating set of \\(G\\) is the \\(k\\)-component domination number of \\(G\\) and is denoted by \\(\\gamma_k(G)\\). Since \\(\\gamma_1(G)=\\gamma(G)\\) and \\(\\gamma_2(G)=\\gamma_t(G)\\), where \\(\\gamma(G)\\) and \\(\\gamma_t(G)\\) denote respectively the domination number and the total domination number, the \\(k\\)-component domination is a natural generalization of domination. A sharp upper bound for \\(\\gamma_k(G)\\) in terms of the size \\(m\\) of \\(G,\\) when \\(G\\neq C_n\\), \\(\\delta\\geq 2\\) and \\(n\\geq k+1\\geq 4\\), is presented in this paper.","citation":[{"@id":"https://portal.mardi4nfdi.de/entity/Q2629281"},{"@id":"https://portal.mardi4nfdi.de/entity/Q4575538"},{"@id":"https://portal.mardi4nfdi.de/entity/Q5422499"},{"@id":"https://portal.mardi4nfdi.de/entity/Q4515631"},{"@id":"https://portal.mardi4nfdi.de/entity/Q3892276"},{"@id":"https://portal.mardi4nfdi.de/entity/Q897314"},{"@id":"https://portal.mardi4nfdi.de/entity/Q4368728"},{"@id":"https://portal.mardi4nfdi.de/entity/Q4508619"},{"@id":"https://portal.mardi4nfdi.de/entity/Q4912481"},{"@id":"https://portal.mardi4nfdi.de/entity/Q2482352"},{"@id":"https://portal.mardi4nfdi.de/entity/Q3490039"},{"@id":"https://portal.mardi4nfdi.de/entity/Q3950587"},{"@id":"https://portal.mardi4nfdi.de/entity/Q4344216"},{"@id":"https://portal.mardi4nfdi.de/entity/Q2446903"}]},"provenance":{"prov:generatedAtTime":"2026-02-17T17:19:22Z","prov:wasAttributedTo":"MaRDI Knowledge Graph"}}