IJPAM: Volume 87, No. 6 (2013)
TOTAL BONDAGE NUMBER OF CERTAIN GRAPHS
Jasintha Quadras
, A. Sajiya Merlin Mahizl
Stella Maris College
Chennai, Tamilnadu, 600 086, INDIA



Chennai, Tamilnadu, 600 086, INDIA
Abstract. A set of a vertices in a graph
is said to be a total dominating set of
if every vertex in
is adjacent to some vertex in
. The total domination number
is the minimum cardinality of a total dominating set. If
, the minimum cardinality of a set
, such that
contains no isolated vertices and
, is called the total bondage number of
. This paper determines the exact values of total bondage number of Wheel graph, Helm graph, Windmill graph, Circular necklace and Friendship graph.
Received: September 6, 2013
AMS Subject Classification: 05C69
Key Words and Phrases: total dominating set, total domination number, total bondage number
Download paper from here.
DOI: 10.12732/ijpam.v87i6.15 How to cite this paper?
Source: International Journal of Pure and Applied Mathematics
ISSN printed version: 1311-8080
ISSN on-line version: 1314-3395
Year: 2013
Volume: 87
Issue: 6