Abstract
The generalization of frame domination concept on graphs is the main aims of this work. In addition, some advanced properties on frame domination have been presented. Some corresponding theorems related to delete, add edges or delete vertices have been proved. Also, the relationship between the original graph and a graph getting from contraction edges has been addressed. Finally, the upper and lower bounds of frame domination number for some special different graphs have been compared and determined.
Export citation and abstract BibTeX RIS
Content from this work may be used under the terms of the Creative Commons Attribution 3.0 licence. Any further distribution of this work must maintain attribution to the author(s) and the title of the work, journal citation and DOI.