AI Chat AI Image Generator AI Video Text to Speech

Complexity of Domination in Triangulated Plane Graphs

09/02/2017
∙
by   Dömötör Pálvölgyi, et al.
∙
0
∙

We prove that for a triangulated plane graph it is NP-complete to determine its domination number and its power domination number.

READ FULL TEXT

page 1

page 2

page 3

page 4

Related Research

research
∙ 02/13/2019

On the achromatic number of signed graphs

In this paper, we generalize the concept of complete coloring and achrom...
0 Dimitri Lajou, et al. ∙
research
∙ 02/01/2021

On the dichromatic number of surfaces

In this paper, we give bounds on the dichromatic number χ⃗(Σ) of a surfa...
0 Pierre Aboulker, et al. ∙
research
∙ 03/11/2018

Calculating the Midsagittal Plane for Symmetrical Bilateral Shapes: Applications to Clinical Facial Surgical Planning

It is difficult to estimate the midsagittal plane of human subjects with...
0 Aarti Jajoo, et al. ∙
research
∙ 08/21/2019

Existence and hardness of conveyor belts

An open problem of Manuel Abellanas asks whether every set of disjoint c...
0 Molly Baird, et al. ∙
research
∙ 01/16/2018

Plane-Casting: 3D Cursor Control with a SmartPhone

We present Plane-Casting, a novel technique for 3D object manipulation f...
0 Nicholas Katzakis, et al. ∙
research
∙ 11/19/2019

The k-Power Domination Number in Some Self-Similar Graphs

The k-power domination problem is a problem in graph theory, which has a...
0 Yulun Xu, et al. ∙
research
∙ 03/17/2019

Circumscribing Polygons and Polygonizations for Disjoint Line Segments

Given a planar straight-line graph G=(V,E) in R^2, a circumscribing poly...
0 Hugo A. Akitaya, et al. ∙

Please sign up or login with your details

Forgot password? Click here to reset

Out of credits

Refill your membership to continue using DeepAI

Stripe
Paypal