On the double Roman domination of graphs

descriptionPublicationkeyboard_double_arrow_right Article 01 Dec 2018 English Publisher:Elsevier BVJournal:Applied Mathematics and Computation, volume 338, pages 669-675 (issn: 0096-3003,

Copyright policy )

Authors: Jun Yue; Meiqin Wei; Min Li 0028; Guodong Liu;

doi: 10.1016/j.amc.2018.06.033

On the double Roman domination of graphs

- Summary
- Subjects
- Metrics

Abstract

zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Related Organizations

Shanghai Maritime University
China (People's Republic of)
Florida State University College of Arts and Sciences
United States
Shandong Normal University
China (People's Republic of)

Keywords

Extremal problems in graph theory, algorithm, double Roman domination, Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.), Coloring of graphs and hypergraphs, Nordhaus-Gaddum type problem, double Roman domination number, cograph

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	10
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Top 10%
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 10%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Top 10%