A bound on weak domination number using strong (weak) degree concepts in graphs (Q2869540)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A bound on weak domination number using strong (weak) degree concepts in graphs |
scientific article; zbMATH DE number 6242794
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A bound on weak domination number using strong (weak) degree concepts in graphs |
scientific article; zbMATH DE number 6242794 |
Statements
3 January 2014
0 references
A bound on weak domination number using strong (weak) degree concepts in graphs (English)
0 references
