AI Chat AI Image Generator AI Video Text to Speech

Roman Domination of the Comet, Double Comet, and Comb Graphs

02/16/2021

∙

by Derya Doğan Durgun, et al.

∙

∙

One of the well-known measurements of vulnerability in graph theory is domination. There are many kinds of dominating and relative types of sets in graphs. However, we are going to focus on Roman domination, which is a type of domination that came up with an article by Ian Stewart. The Roman domination numbers of the comet, double comet, and comb graphs are given in this paper.

Derya Doğan Durgun
1 publication
Emre Niyazi Toprakkaya
1 publication

page 1

page 2

page 3

page 4

research

∙ 05/24/2018

Eternal dominating sets on digraphs and orientations of graphs

We study the eternal dominating number and the m-eternal dominating numb...

0 Guillaume Bagan, et al. ∙

research

∙ 02/22/2018

Efficient Enumeration of Dominating Sets for Sparse Graphs

Dominating sets are fundamental graph structures. However, enumeration o...

0 Kazuhiro Kurita, et al. ∙

research

∙ 09/29/2022

Double negation stable h-propositions in cubical sets

We give a construction of classifiers for double negation stable h-propo...

0 Andrew W Swan, et al. ∙

research

∙ 04/19/2022

Consensus of networked double integrator systems under sensor bias

A novel distributed control law for consensus of networked double integr...

0 Pallavi Sinha, et al. ∙

research

∙ 03/02/2022

Embedding K3,3 and K5 on the Double Torus

The Kuratowski graphs K_3,3 and K_5 characterize planarity. Counting dis...

0 William L. Kocay, et al. ∙

research

∙ 12/12/2019

On Profitability of Nakamoto double spend

Nakamoto double spend strategy, described in Bitcoin foundational articl...

0 Cyril Grunspan, et al. ∙

research

∙ 09/20/2019

Linear-Time Recognition of Double-Threshold Graphs

A graph G = (V,E) is a double-threshold graph if there exist a vertex-we...

0 Yusuke Kobayashi, et al. ∙