Whole domination in graphs

Omran, Ahmed Abd Ali; Ibrahim, Thaer A.

dc.contributor.author	Omran, Ahmed Abd Ali	en_US
dc.contributor.author	Ibrahim, Thaer A.	en_US
dc.date.accessioned	2022-10-05T17:51:56Z
dc.date.available	2022-10-05T17:51:56Z
dc.date.issued	2022
dc.identifier.citation	Omran, A. A. A. & Ibrahim, T. A. (2022). Whole domination in graphs. TWMS Journal Of Applied And Engineering Mathematics, 12(4), 1506-1511.	en_US
dc.identifier.issn	2146-1147	en_US
dc.identifier.issn	2587-1013	en_US
dc.identifier.uri	https://hdl.handle.net/11729/4960
dc.identifier.uri	http://jaem.isikun.edu.tr/web/index.php/archive/117-vol12no4/932
dc.description.abstract	In this paper, a new parameter of domination number in graphs is defined which is called whole domination number denoted by ?wh(G). Some bounds of whole domination number and the number of edges depend on it has been established. Furthermore, the effect of deletion vertex, edge, or add edge have been studied. Also, the effect of the contracting an edge is determined. Finally, some operations between the two graphs have been calculated.	en_US
dc.language.iso	en	en_US
dc.publisher	Işık University Press	en_US
dc.relation.ispartof	TWMS Journal Of Applied And Engineering Mathematics	en_US
dc.rights	info:eu-repo/semantics/openAccess	en_US
dc.rights	Attribution-NonCommercial-NoDerivs 3.0 United States	*
dc.rights.uri	http://creativecommons.org/licenses/by-nc-nd/3.0/us/	*
dc.subject	Whole dominating set	en_US
dc.subject	Whole domination number	en_US
dc.subject	Deletion	en_US
dc.subject	Contracting an edge	en_US
dc.title	Whole domination in graphs	en_US
dc.type	Article	en_US
dc.identifier.volume	12
dc.identifier.issue	4
dc.identifier.startpage	1506
dc.identifier.endpage	1511
dc.relation.publicationcategory	Makale - Uluslararası Hakemli Dergi - Başka Kurum Yazarı	en_US
dc.indekslendigikaynak	Emerging Sources Citation Index (ESCI)	en_US
dc.indekslendigikaynak	MathScinet	en_US
dc.indekslendigikaynak	Scopus	en_US