Resolving hop dominating sets of P3[P4]

Graph P3 • P4 with γ Rh (P3 • P4) = 6

Example of 2-dominating set computed by our algorithm

Pharmaceutics April 2021 - Browse Articles

IJMS, Free Full-Text

PDF) Independent dominating sets and hamiltonian cycles

Plane hop spanners for unit disk graphs: Simpler and better - ScienceDirect

A Better Approximation Algorithm for Computing Connected Dominating Sets in Unit Ball Graphs

Beiträge zur Theorie der Elektronenspektroskopie - Online

An Overview of Algorithms for Network Survivability

Understanding Carrier Transport in Organic Semiconductors: Computation of Charge Mobility Considering Quantum Nuclear Tunneling and Delocalization Effects

Vertices in a locating-total dominating set of P (C8, P4, 3) are circled

PDF) Two upper bounds on the chromatic number

PDF) PERFECT HOP DOMINATION IN GRAPHS RESULTING FROM SOME GRAPH OPERATIONS

The Minimum Principle of SINR: A Useful Discretization Tool for Wireless Communication