Tao Wang
Published 2013-04-01, updated 2015-08-26Version 3
In this paper, we consider various types of domination vertex critical graphs, including total domination vertex critical graphs, independent domination vertex critical graphs and connected domination vertex critical graphs. We provide upper bounds on the diameter of them, two of which are sharp.
Comments: 8 pages in Bulletin of the Malaysian Mathematical Sciences Society, 2015
Good upper bounds for the total rainbow connection of graphs
Improved Upper Bounds on $a'(G\Box H)$
Upper bounds for the bondage number of graphs on topological surfaces
![QR code for arXiv:1304.0274 [math.CO]](http://oss.arxitics.com/images/favicon.svg)