Log in to save to my catalogue

Dominating the Direct Product of Two Graphs through Total Roman Strategies

Dominating the Direct Product of Two Graphs through Total Roman Strategies

https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_doaj_primary_oai_doaj_org_article_460c5efa74d64c35b41ec6ba9ab10856

Dominating the Direct Product of Two Graphs through Total Roman Strategies

About this item

Full title

Dominating the Direct Product of Two Graphs through Total Roman Strategies

Publisher

Basel: MDPI AG

Journal title

Mathematics (Basel), 2020-09, Vol.8 (9), p.1438

Language

English

Formats

Publication information

Publisher

Basel: MDPI AG

More information

Scope and Contents

Contents

Given a graph G without isolated vertices, a total Roman dominating function for G is a function f:V(G)→{0,1,2} such that every vertex u with f(u)=0 is adjacent to a vertex v with f(v)=2, and the set of vertices with positive labels induces a graph of minimum degree at least one. The total Roman domination number γtR(G) of G is the smallest possibl...

Alternative Titles

Full title

Dominating the Direct Product of Two Graphs through Total Roman Strategies

Authors, Artists and Contributors

Identifiers

Primary Identifiers

Record Identifier

TN_cdi_doaj_primary_oai_doaj_org_article_460c5efa74d64c35b41ec6ba9ab10856

Permalink

https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_doaj_primary_oai_doaj_org_article_460c5efa74d64c35b41ec6ba9ab10856

Other Identifiers

ISSN

2227-7390

E-ISSN

2227-7390

DOI

10.3390/math8091438

How to access this item