A polyhedral view to a generalization of multiple domination

Given an undirected simple graph G=(V,E) and integer values fv,v∈V, a node subset D⊆V is called an f-tuple dominating set if, for each node v∈V, its closed neighborhood intersects D in at least fv nodes. We study the polytope that is defined as the convex hull of the incidence vectors in RV of the f...

Full description

Saved in:
Bibliographic Details
Published in:Discrete Applied Mathematics 2022-05, Vol.313, p.1-17
Main Author: Neto, José
Format: Article
Language:English
Subjects:
Computer Science
Convexity
Dominating set
Limited packing
Mathematics
Multiple domination
Polytope
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by
cites cdi_FETCH-LOGICAL-c354t-940af325dd2c0760e2bc3b5b8f9019063ffb95cdd83c8ff9849c2f78d53050cc3
container_end_page 17
container_issue
container_start_page 1
container_title Discrete Applied Mathematics
container_volume 313
creator Neto, José
description Given an undirected simple graph G=(V,E) and integer values fv,v∈V, a node subset D⊆V is called an f-tuple dominating set if, for each node v∈V, its closed neighborhood intersects D in at least fv nodes. We study the polytope that is defined as the convex hull of the incidence vectors in RV of the f-tuple dominating sets in G. New families of valid inequalities are introduced and a complete formulation is given for the case of stars. A corollary of our results is a proof that the conjecture reported in Argiroffo (2013) on a complete formulation of the 2-tuple dominating set polytope of trees does not hold. Preliminary computational results are also reported.
doi_str_mv 10.1016/j.dam.2022.01.011
format article
fullrecord <record><control><sourceid>proquest_hal_p</sourceid><recordid>TN_cdi_hal_primary_oai_HAL_hal_03579253v1</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S0166218X22000178</els_id><sourcerecordid>2654394039</sourcerecordid><originalsourceid>FETCH-LOGICAL-c354t-940af325dd2c0760e2bc3b5b8f9019063ffb95cdd83c8ff9849c2f78d53050cc3</originalsourceid><addsrcrecordid>eNp9kE1LxDAQhoMouK7-AG8FTx5aJ0nTD_SyLOoKC14UvIU0H25Kt6lpd2X99aZWPAoDw7w88zLzInSJIcGAs5s6UWKbECAkARwKH6EZLnISZ3mOj9EsMFlMcPF2is76vgYAHKYZultEnWsOG628aKK91Z_R4CIRvetWB8V-icG6NnIm2u6awXaNjpTb2vZHPkcnRjS9vvjtc_T6cP-yXMXr58en5WIdS8rSIS5TEIYSphSRkGegSSVpxarClIBLyKgxVcmkUgWVhTFlkZaSmLxQjAIDKekcXU--G9Hwztut8AfuhOWrxZqPGlCWl4TRPQ7s1cR23n3sdD_w2u18G87jJGMpDcfQMlB4oqR3fe-1-bPFwMdAec1DoHwMlAMONTrfTjs6vBqS8ryXVrdSK-u1HLhy9p_tbxp8fEc</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2654394039</pqid></control><display><type>article</type><title>A polyhedral view to a generalization of multiple domination</title><source>Elsevier</source><creator>Neto, José</creator><creatorcontrib>Neto, José</creatorcontrib><description>Given an undirected simple graph G=(V,E) and integer values fv,v∈V, a node subset D⊆V is called an f-tuple dominating set if, for each node v∈V, its closed neighborhood intersects D in at least fv nodes. We study the polytope that is defined as the convex hull of the incidence vectors in RV of the f-tuple dominating sets in G. New families of valid inequalities are introduced and a complete formulation is given for the case of stars. A corollary of our results is a proof that the conjecture reported in Argiroffo (2013) on a complete formulation of the 2-tuple dominating set polytope of trees does not hold. Preliminary computational results are also reported.</description><identifier>ISSN: 0166-218X</identifier><identifier>EISSN: 1872-6771</identifier><identifier>DOI: 10.1016/j.dam.2022.01.011</identifier><language>eng</language><publisher>Amsterdam: Elsevier B.V</publisher><subject>Computer Science ; Convexity ; Dominating set ; Limited packing ; Mathematics ; Multiple domination ; Polytope</subject><ispartof>Discrete Applied Mathematics, 2022-05, Vol.313, p.1-17</ispartof><rights>2022 Elsevier B.V.</rights><rights>Copyright Elsevier BV May 31, 2022</rights><rights>Attribution - NonCommercial</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><cites>FETCH-LOGICAL-c354t-940af325dd2c0760e2bc3b5b8f9019063ffb95cdd83c8ff9849c2f78d53050cc3</cites><orcidid>0000-0002-5354-4816</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>230,314,780,784,885,27923,27924</link.rule.ids><backlink>$$Uhttps://hal.science/hal-03579253$$DView record in HAL$$Hfree_for_read</backlink></links><search><creatorcontrib>Neto, José</creatorcontrib><title>A polyhedral view to a generalization of multiple domination</title><title>Discrete Applied Mathematics</title><description>Given an undirected simple graph G=(V,E) and integer values fv,v∈V, a node subset D⊆V is called an f-tuple dominating set if, for each node v∈V, its closed neighborhood intersects D in at least fv nodes. We study the polytope that is defined as the convex hull of the incidence vectors in RV of the f-tuple dominating sets in G. New families of valid inequalities are introduced and a complete formulation is given for the case of stars. A corollary of our results is a proof that the conjecture reported in Argiroffo (2013) on a complete formulation of the 2-tuple dominating set polytope of trees does not hold. Preliminary computational results are also reported.</description><subject>Computer Science</subject><subject>Convexity</subject><subject>Dominating set</subject><subject>Limited packing</subject><subject>Mathematics</subject><subject>Multiple domination</subject><subject>Polytope</subject><issn>0166-218X</issn><issn>1872-6771</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2022</creationdate><recordtype>article</recordtype><recordid>eNp9kE1LxDAQhoMouK7-AG8FTx5aJ0nTD_SyLOoKC14UvIU0H25Kt6lpd2X99aZWPAoDw7w88zLzInSJIcGAs5s6UWKbECAkARwKH6EZLnISZ3mOj9EsMFlMcPF2is76vgYAHKYZultEnWsOG628aKK91Z_R4CIRvetWB8V-icG6NnIm2u6awXaNjpTb2vZHPkcnRjS9vvjtc_T6cP-yXMXr58en5WIdS8rSIS5TEIYSphSRkGegSSVpxarClIBLyKgxVcmkUgWVhTFlkZaSmLxQjAIDKekcXU--G9Hwztut8AfuhOWrxZqPGlCWl4TRPQ7s1cR23n3sdD_w2u18G87jJGMpDcfQMlB4oqR3fe-1-bPFwMdAec1DoHwMlAMONTrfTjs6vBqS8ryXVrdSK-u1HLhy9p_tbxp8fEc</recordid><startdate>20220531</startdate><enddate>20220531</enddate><creator>Neto, José</creator><general>Elsevier B.V</general><general>Elsevier BV</general><general>Elsevier</general><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>1XC</scope><scope>VOOES</scope><orcidid>https://orcid.org/0000-0002-5354-4816</orcidid></search><sort><creationdate>20220531</creationdate><title>A polyhedral view to a generalization of multiple domination</title><author>Neto, José</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c354t-940af325dd2c0760e2bc3b5b8f9019063ffb95cdd83c8ff9849c2f78d53050cc3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2022</creationdate><topic>Computer Science</topic><topic>Convexity</topic><topic>Dominating set</topic><topic>Limited packing</topic><topic>Mathematics</topic><topic>Multiple domination</topic><topic>Polytope</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Neto, José</creatorcontrib><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts – Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>Hyper Article en Ligne (HAL)</collection><collection>Hyper Article en Ligne (HAL) (Open Access)</collection><jtitle>Discrete Applied Mathematics</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Neto, José</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A polyhedral view to a generalization of multiple domination</atitle><jtitle>Discrete Applied Mathematics</jtitle><date>2022-05-31</date><risdate>2022</risdate><volume>313</volume><spage>1</spage><epage>17</epage><pages>1-17</pages><issn>0166-218X</issn><eissn>1872-6771</eissn><abstract>Given an undirected simple graph G=(V,E) and integer values fv,v∈V, a node subset D⊆V is called an f-tuple dominating set if, for each node v∈V, its closed neighborhood intersects D in at least fv nodes. We study the polytope that is defined as the convex hull of the incidence vectors in RV of the f-tuple dominating sets in G. New families of valid inequalities are introduced and a complete formulation is given for the case of stars. A corollary of our results is a proof that the conjecture reported in Argiroffo (2013) on a complete formulation of the 2-tuple dominating set polytope of trees does not hold. Preliminary computational results are also reported.</abstract><cop>Amsterdam</cop><pub>Elsevier B.V</pub><doi>10.1016/j.dam.2022.01.011</doi><tpages>17</tpages><orcidid>https://orcid.org/0000-0002-5354-4816</orcidid><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier ISSN: 0166-218X
ispartof Discrete Applied Mathematics, 2022-05, Vol.313, p.1-17
issn 0166-218X
1872-6771
language eng
recordid cdi_hal_primary_oai_HAL_hal_03579253v1
source Elsevier
subjects Computer Science
Convexity
Dominating set
Limited packing
Mathematics
Multiple domination
Polytope
title A polyhedral view to a generalization of multiple domination
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-11T19%3A11%3A48IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_hal_p&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20polyhedral%20view%20to%20a%20generalization%20of%20multiple%20domination&rft.jtitle=Discrete%20Applied%20Mathematics&rft.au=Neto,%20Jos%C3%A9&rft.date=2022-05-31&rft.volume=313&rft.spage=1&rft.epage=17&rft.pages=1-17&rft.issn=0166-218X&rft.eissn=1872-6771&rft_id=info:doi/10.1016/j.dam.2022.01.011&rft_dat=%3Cproquest_hal_p%3E2654394039%3C/proquest_hal_p%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c354t-940af325dd2c0760e2bc3b5b8f9019063ffb95cdd83c8ff9849c2f78d53050cc3%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=2654394039&rft_id=info:pmid/&rfr_iscdi=true