Abstract
A graph G is said to be k-gamma(c)-critical if the connected domination number gamma(c)(G) of G is k and gamma(c)(G + uv) < k for every uv (sic) E(......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
