Mixed Roman domination in graphs
type: Item
instance of: scholarly article
title: Mixed Roman domination in graphs
zbMATH Open document ID: 1386.05129
author: Teresa W. Haynes
author: J. Carlos Valenzuela-Tripodoro
author: H. Abdollahzadeh Ahangar
published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series
publication date: 2017-12-08T00:00:00Z
Mathematics Subject Classification ID: 05C69
zbMATH DE Number: 6816698
zbMATH Keywords: Roman dominating function
zbMATH Keywords: Roman domination number
zbMATH Keywords: mixed Roman dominating function
zbMATH Keywords: mixed Roman domination number
MaRDI profile type: Publication
full work available at URL: s40840-015-0141-1
OpenAlex ID: W788806422
cites work: Q3166091
cites work: Total matchings and total coverings of graphs
cites work: On total covers of graphs
cites work: The differential and the roman domination number of a graph
cites work: A note on the independent Roman domination in unicyclic graphs
cites work: Strong equality between the Roman domination and independent Roman domination numbers in trees
cites work: A linear algorithm for the domination number of a tree
cites work: Roman domination in graphs.
cites work: Bounds for independent Roman domination in graphs.
cites work: On total matching numbers and total covering numbers of complementary graphs
cites work: An approximation algorithm for the total covering problem
cites work: Q4368728
cites work: Q5405490
cites work: On the mixed domination problem in graphs
cites work: Defendens Imperium Romanum: A Classical Problem in Military Strategy
cites work: The algorithmic complexity of mixed domination in graphs
DOI: 10.1007/S40840-015-0141-1
description: scientific article; zbMATH DE number 6816698