Edge H-domination in graph

Kakrecha, Bhavesh

dc.contributor.author	Kakrecha, Bhavesh	en_US
dc.date.accessioned	2021-04-07T11:12:26Z
dc.date.available	2021-04-07T11:12:26Z
dc.date.issued	2021
dc.identifier.citation	Kakrecha, B. (2021). Edge H-domination in graph. TWMS Journal of Applied and Engineering Mathematics, 11(2), 448-458.	en_US
dc.identifier.issn	2146-1147
dc.identifier.issn	2587-1013
dc.identifier.uri	https://hdl.handle.net/11729/3122
dc.identifier.uri	http://jaem.isikun.edu.tr/web/index.php/archive/111-vol11-no2/703
dc.description.abstract	This paper is about edge H-domination of the graph. The edge H-dominating set is defined and the characterization of a minimal edge H-dominating set of the graph with minimum degree 2 is given. The upper bound on the edge H-domination number of the graph is discussed. The changes in the edge H-domination number are observed under vertex(edge) removal operation on graph. The concepts called weak isolated edge and edge H-private neighborhood of the graph are defined.	en_US
dc.language.iso	eng	en_US
dc.publisher	Işık University Press	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	Edge dominating set	en_US
dc.subject	Edge domination number	en_US
dc.subject	Edge H-dominating set	en_US
dc.subject	Edge H-domination number	en_US
dc.subject	Weak isolated edge	en_US
dc.subject	Edge H-private neighborhood	en_US
dc.title	Edge H-domination in graph	en_US
dc.type	article	en_US
dc.description.version	Publisher's Version	en_US
dc.relation.journal	TWMS Journal of Applied and Engineering Mathematics	en_US
dc.identifier.volume	11
dc.identifier.issue	2
dc.identifier.startpage	448
dc.identifier.endpage	458
dc.peerreviewed	Yes	en_US
dc.publicationstatus	Published	en_US
dc.relation.publicationcategory	Makale - Uluslararası Hakemli Dergi - Başka Kurum Yazarı	en_US