Co-Roman dominating of girds
Authors
Abstract:
This article doesn't have abstract
similar resources
Roman dominating influence parameters
A function f : V (G) → {0, 1, 2} is a Roman dominating function for a graph G = (V,E) if for every vertex v with f(v) = 0, there exists a vertex w ∈ N(v) with f(w) = 2. Emperor Constantine had the requirement that an army or legion could be sent from its home to defend a neighboring location only if there was a second army which would stay and protect the home. Thus, there are two types of armi...
full textCo-Roman domination in trees
Abstract: Let G=(V,E) be a graph and let f:V(G)→{0,1,2} be a function. A vertex v is protected with respect to f, if f(v)>0 or f(v)=0 and v is adjacent to a vertex of positive weight. The function f is a co-Roman dominating function, abbreviated CRDF if: (i) every vertex in V is protected, and (ii) each u∈V with positive weight has a neighbor v∈V with f(v)=0 such that the func...
full textServer Placements, Roman Domination and other Dominating Set Variants
Dominating sets in their many variations model a wealth of optimization problems like facility location or distributed le sharing. For instance, when a request can occur at any node in a graph and requires a server at that node, a minimumdominating set represents a minimum set of servers that serve an arbitrary single request by moving a server along at most one edge. This paper studies dominat...
full textCounting the Number of Minimum Roman Dominating Functions of a Graph
We provide two algorithms counting the number of minimum Roman dominating functions of a graph on n vertices in (1.5673) n time and polynomial space. We also show that the time complexity can be reduced to (1.5014) n if exponential space is used. Our result is obtained by transforming the Roman domination problem into other combinatorial problems on graphs for which exact algorithms already exist.
full textIncidence dominating numbers of graphs
In this paper, the concept of incidence domination number of graphs is introduced and the incidence dominating set and the incidence domination number of some particular graphs such as paths, cycles, wheels, complete graphs and stars are studied.
full textOntology-based Virtual Data Integration for E-Science Girds
For scientific collaboration, sharing data between different parties is fundamental. Grids, originally developed for high-performance and parallel computing, enable the sharing of distributed resources across institutional boundaries by providing a security infrastructure and standardized Grid-services. Because data is usually stored in different information systems and schemes, at the moment t...
full textMy Resources
Journal title
volume 8 issue 3
pages 80- 90
publication date 2022-11
By following a journal you will be notified via email when a new issue of this journal is published.
No Keywords
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023