Vector domination in split-indifference graphs

DOI10.1016/j.ipl.2019.105899zbMath1481.05117OpenAlexW2990646880WikidataQ126652855 ScholiaQ126652855MaRDI QIDQ2281167

Rodrigo Lamblet Mafort, Fábio Protti

Publication date: 19 December 2019

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2019.105899

zbMATH Keywords

split graphgraph algorithmsunit interval graphsplit-indifference graphvector domination problem

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items

Domination and convexity problems in the target set selection model

Cites Work

• Unnamed Item
• A study of monopolies in graphs
• Irreversible conversion of graphs
• Dominating sets for split and bipartite graphs
• Irreversible \(k\)-threshold processes: Graph-theoretical threshold models of the spread of disease and of opinion
• On the computation of the hull number of a graph
• Characterizing and edge-colouring split-indifference graphs
• Domination parameters with number 2: interrelations and algorithmic consequences
• On the approximability and exact algorithms for vector domination and related problems in graphs
• Upper bounds to the clique width of graphs
• Latency-bounded target set selection in social networks
• Dominating Sets in Chordal Graphs
• Counting and enumerating unlabeled split–indifference graphs
• Computations by fly-automata beyond monadic second-order logic