To Find a Non-Split Strong Dominating Set of an Interval Graph Using an Algorithm

IOSR Journal of Mathematics
doi 10.9790/5728-0620510
Full Text
Abstract

Available in full text

Date
Authors
Publisher

IOSR Journals

Related search

Development of Effective Algorithm to Find an Optimal Solution to the Problem on Graph Matching With "Disappearing" Arcs

EasternEuropean Journal of Enterprise Technologies
ControlElectronic EngineeringIndustrialMechanical EngineeringEnergy EngineeringApplied MathematicsSystems EngineeringManufacturing EngineeringComputer Science ApplicationsElectricalInnovationManagement of TechnologyPower Technology
2017English

IOG - An Improved Approach to Find Optimal Grid Size Using Grid Clustering Algorithm

IOSR Journal of Computer Engineering
2014English

A Generalized Graph Strict Strong Coloring Algorithm

International Journal of Applied Metaheuristic Computing
ControlStatisticsProbabilityOptimizationDecision SciencesComputational TheorySimulationComputer Science ApplicationsComputational MathematicsMathematicsModeling
2012English

Connected Dominating Set Construction Using an Efficient Pruning Method in Ad Hoc Networks

2010English

An Efficient Connected Dominating Set Algorithm in WSNs Based on the Induced Tree of the Crossed Cube

International Journal of Applied Mathematics and Computer Science
2015English

An Algorithm for the Feedback Vertex Set Problem on a Normal Helly Circular-Arc Graph

Journal of Computer and Communications
2016English

An Algorithm to Find Minimal Cuts of Coherent Fault-Trees With Event-Classes, Using a Decision Tree

IEEE Transactions on Reliability
Electronic EngineeringRiskReliabilityElectricalSafetyQuality
1999English

Using Technology to Find the Graph Characteristic of Quadratic Function

2018English

The Minimum Dominating Energy of a Graph

International Journal of Pure and Applied Mathematics
MathematicsApplied Mathematics
2013English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy