Article
Version 1
Preserved in Portico This version is not peer-reviewed
On Total Vertex-Edge Domination
Version 1
: Received: 10 July 2018 / Approved: 11 July 2018 / Online: 11 July 2018 (10:52:10 CEST)
How to cite: Şahin, B.; Şahin, A. On Total Vertex-Edge Domination. Preprints 2018, 2018070195. https://doi.org/10.20944/preprints201807.0195.v1 Şahin, B.; Şahin, A. On Total Vertex-Edge Domination. Preprints 2018, 2018070195. https://doi.org/10.20944/preprints201807.0195.v1
Abstract
A novel domination invariant defined by Boutrig and Chellali in the recent: total vertex-edge domination. In this paper we obtain an improved upper bound of total vertex edge-domination number of a tree. If is a connected tree with order , then with and we characterize the trees attaining this upper bound. Furthermore we provide a characterization of trees with
Keywords
domination, vertex-edge domination, total vertex-edge domination
Subject
Computer Science and Mathematics, Algebra and Number Theory
Copyright: This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Comments (0)
We encourage comments and feedback from a broad range of readers. See criteria for comments and our Diversity statement.
Leave a public commentSend a private comment to the author(s)
* All users must log in before leaving a comment
