main webpage
W Topic
Computer Science
RAIRO. Operations research • Vol 58 • No 4
On maximal Roman domination in graphs: complexity and algorithms
2024
For a simple undirected connected graph G = ( V, E ), a maximal Roman dominating function (MRDF) of G is a function f : V ( G ) → {0, 1, 2} with the following properties: ( i ) For every vertex v ∈ { v ∈ V | f ( v ) = 0}, there exists a vertex u ∈ N ( v ) suc…
Article

Computer Science

Study of computation

Computer science is the study of computation, information, and automation. Computer science spans theoretical disciplines (such as algorithms, theory of computation, and information theory) to applied disciplines (including the design and implementation of hardware and software).

Algorithms and data structures are central to computer science. The theory of computation concerns abstract models of computation and general classes of problems that can be solved using them. The fields of cryptography and computer security involve studying the means for secure communication and preventing security vulnerabilities. Computer graphics and computational geometry address the generation of images.

Exploring foci of:
RAIRO. Operations research • Vol 58 • No 4
On maximal Roman domination in graphs: complexity and algorithms
2024
For a simple undirected connected graph G = ( V, E ), a maximal Roman dominating function (MRDF) of G is a function f : V ( G ) → {0, 1, 2} with the following properties: ( i ) For every vertex v ∈ { v ∈ V | f ( v ) = 0}, there exists a vertex u ∈ N ( v ) such that f ( u ) = 2. ( ii ) The set { v ∈ V|f ( v ) = 0} is not a dominating set of G ; In other words, there exists a vertex v ∈ { v ∈ V | f ( v ) ≠ 0} such that N ( v ) ∩ { u ∈ V | f ( u ) = 0} ∅ . The weight of an MRDF of G is the sum of its function values …
Click Computer Science Vs:
Algorithm
Combinatorics
Mathematics