
Reducing the domination number of graphs via edge contractions
In this paper, we study the following problem: given a connected graph G...
read it

Complexity of Edge Monitoring on Some Graph Classes
In this paper, we study the complexity of the edge monitoring problem. A...
read it

FixedParameter Algorithms for Graph Constraint Logic
Nondeterministic constraint logic (NCL) is a simple model of computatio...
read it

Learning ErdősRényi Random Graphs via Edge Detecting Queries
In this paper, we consider the problem of learning an unknown graph via ...
read it

Statistical inference on errorfully observed graphs
Statistical inference on graphs is a burgeoning field in the applied and...
read it

3D Density Histograms for Criteriadriven Edge Bundling
This paper presents a graph bundling algorithm that agglomerates edges t...
read it

Concise Fuzzy Representation of Big Graphs: a Dimensionality Reduction Approach
The enormous amount of data to be represented using large graphs exceeds...
read it
Using edge contractions to reduce the semitotal domination number
In this paper, we consider the problem of reducing the semitotal domination number of a given graph by contracting k edges, for some fixed k ≥ 1. We show that this can always be done with at most 3 edge contractions and further characterise those graphs requiring 1, 2 or 3 edge contractions, respectively, to decrease their semitotal domination number. We then study the complexity of the problem for k=1 and obtain in particular a complete complexity dichotomy for monogenic classes.
READ FULL TEXT
Comments
There are no comments yet.