Some Progress on Total Bondage in Graphs

Nader Jafari Rad; Joanna Raczek

doi:10.1007/s00373-013-1303-2

Some Progress on Total Bondage in Graphs

Abstract

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.

Citations

3

CrossRef
0

Web of Science
2

Scopus

Authors (2)

Nader Jafari Rad
- Sharhrood University of Technology Department of Mathematics
Joanna Raczek dr inż.

Cite as

Full text

download paper

downloaded 21 times

Publication version: Accepted or Published Version
DOI:: Digital Object Identifier (open in new tab) 10.1007/s00373-013-1303-2
License: open in new tab

full content of the article see on external site open in new tab

Keywords

DOMINATION NUMBER · TOTAL DOMINATION · TOTAL BONDAGE · TREE

Details

Category:: Articles
Type:: artykuł w czasopiśmie wyróżnionym w JCR
Published in:: GRAPHS AND COMBINATORICS no. 30, edition 3, pages 717 - 728,
ISSN: 0911-0119
Language:: English
Publication year:: 2014
Bibliographic description:: Rad N., Raczek J.: Some Progress on Total Bondage in Graphs// GRAPHS AND COMBINATORICS. -Vol. 30, iss. 3 (2014), s.717-728
DOI:: Digital Object Identifier (open in new tab) 10.1007/s00373-013-1303-2
Verified by:: Gdańsk University of Technology