On computing total double Roman domination number of trees in linear time

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

Poureidi Abolfazl

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: JOURNAL OF ALGORITHMS AND COMPUTATION Year:2020 | Volume:52 | Issue:1 Page(s): 131-137

Download Full-Text

View:

161

Download:

Cites:

Information Journal Paper

Title

On computing total double Roman domination number of trees in linear time

Author(s)

Poureidi Abolfazl | Issue Writer Certificate

Keywords

Total double Roman dominating function

linear algorithm

Dynamic programming

Combinatorial optimiza-tion

Tree

Abstract

Let G = (V; E) be a graph. A double Roman dominating function (DRDF) on G is a function f: V! f0; 1; 2; 3g such that for every vertex v 2 V if f(v) = 0, then either there is a vertex u adjacent to v with f(u) = 3 or there are vertices x and y adjacent to v with f(x) = f(y) = 2 and if f(v) = 1, then there is a vertex u adjacent to v with f(u) 2. A DRDF f on G is a total DRDF (TDRDF) if for any v 2 V with f(v) > 0 there is a vertex u adjacent to v with f(u) > 0. The weight of f is the sum f(V ) = P v2V f(v). The minimum weight of a TDRDF on G is the total double Roman domination number of G. In this paper, we give a linear algorithm to compute the total double Roman domination number of a given Tree.

Multimedia

No record.

Cites

No record.

References

No record.

Cite

APA: Copy

Poureidi, Abolfazl. (2020). On computing total double Roman domination number of trees in linear time. JOURNAL OF ALGORITHMS AND COMPUTATION, 52(1), 131-137. SID. https://sid.ir/paper/354593/en

Vancouver: Copy

Poureidi Abolfazl. On computing total double Roman domination number of trees in linear time. JOURNAL OF ALGORITHMS AND COMPUTATION[Internet]. 2020;52(1):131-137. Available from: https://sid.ir/paper/354593/en

IEEE: Copy

Abolfazl Poureidi, “On computing total double Roman domination number of trees in linear time,” JOURNAL OF ALGORITHMS AND COMPUTATION, vol. 52, no. 1, pp. 131–137, 2020, [Online]. Available: https://sid.ir/paper/354593/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops