About -ve domination in graphs

dc.contributor.author	Thakkar, D.K.
dc.contributor.author	Jamvecha, Neha P.
dc.date.accessioned	2023-05-01T02:41:50Z
dc.date.available	2023-05-01T02:41:50Z
dc.date.issued	2017-09-06
dc.identifier.citation	Thakkar, D. K., & Jamvecha, N. P. (2017). About ve-domination in graphs. Annals of Pure and Applied Mathematics, 14(2), 245-250.	en_US
dc.identifier.issn	2279-0888
dc.identifier.uri	http://10.9.150.37:8080/dspace//handle/atmiyauni/804
dc.description	Acknowledgement: The authors are thankful to the reviewer for their comments and suggestions for improving the quality of this paper.	en_US
dc.description.abstract	The paper is about the ve-domination (vertex-edge domination) in graphs. Necessary and sufficient conditions are proved under which the ve-domination number decreases or increases.	en_US
dc.language.iso	en	en_US
dc.publisher	Annals of Pure and Applied Mathematics	en_US
dc.subject	ve-dominating set	en_US
dc.subject	minimal ve-dominating set	en_US
dc.subject	minimum ve-dominating set	en_US
dc.subject	ve-domination number	en_US
dc.subject	edge private neighbourhood	en_US
dc.title	About -ve domination in graphs	en_US
dc.type	Article	en_US