k-defensive domination, a variant of the classical domination problem on...
Although it has been claimed in two different papers that the maximum
ca...
A widely studied problem in communication networks is that of finding th...
A matching of a graph is a subset of edges no two of which share a commo...
It is known that any chordal graph on n vertices can be represented as t...
The concept of Reload cost in a graph refers to the cost that occurs whi...