Unique response strong Roman dominating functions of graphs

Unique response strong Roman dominating functions of graphs

Given a simple graph G=(V,E) with maximum degree Δ. Let (V0, V1, V2) be an ordered partition of V, where Vi = {v ∈ V : f(v)=i} for i = 0, 1 and V2 = {v ∈ V : f(v)≥2}. A function f : V → {0, 1, ..., ⌈Δ/2⌉+1} is a strong Roman dominating function (StRDF) on G, if every v ∈ V0 has a neighbor w ∈ V2 and...

Full description

Saved in:
Bibliographic Details
Main Authors: Mojdeh, Doost Ali; Department of Mathematics, University of Mazandaran, Babolsar, Iran (Author), Hao, Guoliang; College of Science, East China University of Technology, Nanchang 330013, People's Republic of China (Author), Masoumi, Iman; Department of Mathematics, University of Tafresh, Tafresh, Iran (Author), Parsian, Ali; Department of Mathematics, University of Tafresh, Tafresh, Iran (Author)
Other Authors: National Natural Science Foundation of China (Contributor)
Format: EJournal Article
Published: GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB, 2021-10-16.
Subjects:
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
Peer-reviewed Article
Online Access:Get Fulltext
Tags: Add Tag
No Tags, Be the first to tag this record!

Internet

Get Fulltext

3rd Floor Main Library

Holdings details from 3rd Floor Main Library
Call Number: A1234.567
Copy 1 Available

Similar Items