Asset Details
Do you wish to reserve the book?
EXTENDED ROMAN DOMINATION OF CYCLERELATED GRAPHS
Hey, we have placed the reservation for you!
By the way, why not check out events that you can attend while you pick your title.
Oops! Something went wrong.
Looks like we were not able to place the reservation. Kindly try again later.
Are you sure you want to remove the book from the shelf?
EXTENDED ROMAN DOMINATION OF CYCLERELATED GRAPHS
Do you wish to request the book?
EXTENDED ROMAN DOMINATION OF CYCLERELATED GRAPHS
Please be aware that the book you have requested cannot be checked out. If you would like to checkout this book, you can reserve another copy
We have requested the book for you!
Your request is successful and it will be processed during the Library working hours. Please check the status of your request in My Requests.
Oops! Something went wrong.
Looks like we were not able to place your request. Kindly try again later.
Journal Article
EXTENDED ROMAN DOMINATION OF CYCLERELATED GRAPHS
2022
Overview
On a graph G=(V,E), an Extended Roman Domination function is f: V → {0,1,2,3} satisfying the criteria that (i) every vertex u for which f(u) is either 0 or 1 is adjacent to at least one vertex v for which f(v) = 3, and(ii) if u and v are two adjacent vertices and if f(u) = 0 then f(v) ≠ 0. The sum of values assigned to all vertices determines the weight of an Extended Roman Domination function. The Extended Roman Domination number of G, indicated by γ erd is the minimal weight of an Extended Roman Domination function on a graph G. The ‘extended Roman domination’ of ‘sunlet, pan, wheel, gear, helm, and web graph’ is investigated in this research.
Publisher
NeuroQuantology
Subject
We currently cannot retrieve any items related to this title. Kindly check back at a later time.