{"@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/Q1297430","@type":"DigitalObject","kernel":{"@id":"https://fdo.portal.mardi4nfdi.de/fdo/Q1297430","digitalObjectType":"https://schema.org/ScholarlyArticle","primaryIdentifier":"mardi:Q1297430","kernelVersion":"v1","immutable":true,"modified":"2025-12-25T09:28:57Z"},"profile":{"@context":"https://schema.org","@type":"ScholarlyArticle","@id":"https://portal.mardi4nfdi.de/entity/Q1297430","name":"Minus domination in graphs","headline":"Minus domination in graphs","description":"scientific article; zbMATH DE number 1321790","url":"https://portal.mardi4nfdi.de/entity/Q1297430","datePublished":"2000-01-09","author":[{"@id":"https://portal.mardi4nfdi.de/entity/Q186200"},{"@id":"https://portal.mardi4nfdi.de/entity/Q1356463"},{"@id":"https://portal.mardi4nfdi.de/entity/Q251500"},{"@id":"https://portal.mardi4nfdi.de/entity/Q251501"}],"publisher":[{"@id":"https://portal.mardi4nfdi.de/entity/Q175483"}],"identifier":{"@type":"PropertyValue","propertyID":"doi","value":"10.1016/S0012-365X(98)00284-2","url":"https://doi.org/10.1016/S0012-365X(98)00284-2"},"sameAs":["https://doi.org/10.1016/S0012-365X(98)00284-2"],"comment":"Let \\(G\\) be a graph with vertex set \\(V\\). A function \\(f: V\\to\\{-1,0,1\\}\\) is called a minus dominating function on \\(G\\), if the sum of its values over the closed neighbourhood \\(N[v]\\) of an arbitrary vertex \\(v\\in V\\) is at least 1. The weight \\(w(f)\\) is defined by \\(\\sum_{x\\in V}f(x)\\). The minimum of \\(w(f)\\) taken over all minus dominating functions \\(f\\) on \\(G\\) is called the minus domination number \\(\\gamma^-(G)\\) of \\(G\\). If the set \\(\\{0,1\\}\\) is used instead of \\(\\{-1,0,1\\}\\), then we have the definition of the domination number \\(\\gamma(G)\\) of \\(G\\). In the paper it is proved that \\(\\gamma(G)- \\gamma^-(T)\\leq (n-4)/5\\) for every tree \\(T\\) with \\(n\\geq 4\\) vertices. There exist outerplanar graphs, chordal graphs and bipartite graphs with \\(\\gamma^-(G)\\) arbitrarily small. If the degrees of the vertices do not exceed 5, then \\(\\gamma^-(G)\\) is nonnegative. At the end the minimum number \\(p(n,\\gamma^-)\\) of vertices of a graph with \\(n\\) vertices and with the minus domination number \\(\\gamma^-\\) is studied.","citation":[{"@id":"https://portal.mardi4nfdi.de/entity/Q4350166"},{"@id":"https://portal.mardi4nfdi.de/entity/Q1157348"},{"@id":"https://portal.mardi4nfdi.de/entity/Q4175592"},{"@id":"https://portal.mardi4nfdi.de/entity/Q4014312"},{"@id":"https://portal.mardi4nfdi.de/entity/Q5753985"},{"@id":"https://portal.mardi4nfdi.de/entity/Q1917346"},{"@id":"https://portal.mardi4nfdi.de/entity/Q1910590"},{"@id":"https://portal.mardi4nfdi.de/entity/Q4307055"},{"@id":"https://portal.mardi4nfdi.de/entity/Q1324692"},{"@id":"https://portal.mardi4nfdi.de/entity/Q4368728"},{"@id":"https://portal.mardi4nfdi.de/entity/Q4368729"},{"@id":"https://portal.mardi4nfdi.de/entity/Q1174126"}]},"provenance":{"prov:generatedAtTime":"2025-12-25T09:28:57Z","prov:wasAttributedTo":"MaRDI Knowledge Graph"}}