Repozytorium publikacji - Politechnika Gdańska

The total bondage number b_t(G) of a graph G with no isolated vertex is the cardinality of a smallest set of edges E'⊆E(G) for which (1) G−E' has no isolated vertex, and (2) γ_t(G−E')>γ_t(G). We improve some results on the total bondage number of a graph and give a constructive characterization of a certain class of trees achieving the upper bound on the total bondage number.

Autorzy

• Nader Jafari Rad,
• dr inż. Joanna Raczek link otwiera się w nowej karcie