On Bondage Numbers of Graphs -- a survey with some comments

Details On Bondage Numbers of Graphs -- a survey with some comments On Bondage Numbers of Graphs -- a survey with some comments

2012-04-18

arxiv.org/abs/1204.4010v1

Mathematics

Combinatorics

80 page; 14 figures; 120 references

Scientific paper

The bondage number of a nonempty graph $G$ is the cardinality of a smallest
edge set whose removal from $G$ results in a graph with domination number
greater than the domination number of $G$. This lecture gives a survey on the
bondage number, including the known results, problems and conjectures. We also
summarize other types of bondage numbers.

Affiliated with

Also associated with

No associations

Rating

On Bondage Numbers of Graphs -- a survey with some comments does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On Bondage Numbers of Graphs -- a survey with some comments, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On Bondage Numbers of Graphs -- a survey with some comments will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-411356