Search engine for discovering works of Art, research articles, and books related to Art and Culture
Javascript must be enabled to continue!
Linear programming formulation for some generalized domination parameters
View through CrossRef
An enormous number of domination parameters have been defined and studied, because of their applications in various fields of science and engineering. From it, we have selected some variation of domination parameters and its generalized form for the study. We have presented a linear programming formulation with linear number of constraints for the selected parameters. MATLAB algorithmic code has been generated to find a minimum dominating set/function and the domination number of the selected parameters. The domination number and its computational time of five generalized domination parameters, [Formula: see text]-domination, [Formula: see text]-domination, efficient [Formula: see text]-domination, factor domination and [Formula: see text]-domination, have been studied under grid graphs and randomly generated graphs. The computational time for efficient [Formula: see text]-domination and [Formula: see text]-domination numbers is less than [Formula: see text] s, which shows the effectiveness of the formulation.
World Scientific Pub Co Pte Ltd
Title: Linear programming formulation for some generalized domination parameters
Description:
An enormous number of domination parameters have been defined and studied, because of their applications in various fields of science and engineering.
From it, we have selected some variation of domination parameters and its generalized form for the study.
We have presented a linear programming formulation with linear number of constraints for the selected parameters.
MATLAB algorithmic code has been generated to find a minimum dominating set/function and the domination number of the selected parameters.
The domination number and its computational time of five generalized domination parameters, [Formula: see text]-domination, [Formula: see text]-domination, efficient [Formula: see text]-domination, factor domination and [Formula: see text]-domination, have been studied under grid graphs and randomly generated graphs.
The computational time for efficient [Formula: see text]-domination and [Formula: see text]-domination numbers is less than [Formula: see text] s, which shows the effectiveness of the formulation.
Related Results
Domination of Polynomial with Application
Domination of Polynomial with Application
In this paper, .We .initiate the study of domination. polynomial , consider G=(V,E) be a simple, finite, and directed graph without. isolated. vertex .We present a study of the Ira...
Selection of Injectable Drug Product Composition using Machine Learning Models (Preprint)
Selection of Injectable Drug Product Composition using Machine Learning Models (Preprint)
BACKGROUND
As of July 2020, a Web of Science search of “machine learning (ML)” nested within the search of “pharmacokinetics or pharmacodynamics” yielded over 100...
Completion and decomposition of hypergraphs by domination hypergraphs
Completion and decomposition of hypergraphs by domination hypergraphs
A graph consists of a finite non-empty set of vertices and a set of unordered pairs of vertices, called edges. A dominating set of a graph is a set of vertices D such that every ve...
Domination of polynomial with application
Domination of polynomial with application
In this paper, .We .initiate the study of domination. polynomial , consider G=(V,E) be a simple, finite, and directed graph without. isolated. vertex .We present a study of the Ira...
Impact of Common Anticoagulants on Complete Blood Count Parameters Among Humans
Impact of Common Anticoagulants on Complete Blood Count Parameters Among Humans
Abstract
Introduction
Among the most frequently used anticoagulants in hematological testing are tetra-acetic acid (EDTA), sodium citrate, and sodium heparin. However, there is a n...
Programming model abstractions for optimizing I/O intensive applications
Programming model abstractions for optimizing I/O intensive applications
This thesis contributes from the perspective of task-based programming models to the efforts of optimizing I/O intensive applications. Throughout this thesis, we propose programmin...
Independent and total domination in antiprism graphs from convex polytopes
Independent and total domination in antiprism graphs from convex polytopes
Let [Formula: see text] be a connected graph. Antiprism graphs, defined as the skeletons of antiprism-shaped convex polytopes, consist of [Formula: see text] vertices and [Formula:...
ASP Formulation Development Journey, Optimisation and Validation for Mangala Field
ASP Formulation Development Journey, Optimisation and Validation for Mangala Field
Abstract
Mangala is a large low salinity, high quality fluvial oil field reservoir in India with STOIIP of over one billion barrels of waxy and moderately viscous cr...