An upper bound for the restrained domination number of a graph with minimum degree at least two in terms of order and minimum degree
Academic Article
- Overview
- Identity
- Additional document info
- View All