We are not able to resolve this OAI Identifier to the repository landing page. If you are the repository manager for this record, please head to the Dashboard and adjust the settings.
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Abstract
A graph G is k-dot-critical (totally k-dot-critical) if G is dot-critical (totally dot-critical) and the domination number is k. In the paper [T. Burtona, D. P. Sumner, Domination dot-critical graphs, Discrete Math, 306(2006), 11-18] the following question is posed: What are the best bounds for the diameter of a k-dot-critical graph and a totally k-dot-critical graph G with no critical vertices for k ≥ 4? We find the best bound for the diameter of a k-dot-critical graph, where k ∈ {4, 5, 6} and we give a family of k-dot-critical graphs (with no critical vertices) with sharp diameter 2k - 3 for even k ≥ 4
Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.