The edge-to-vertex Steiner domination number of a graph
Citation
John, J. & Ancymary, S. (2022). The edge-to-vertex Steiner domination number of a graph. TWMS Journal Of Applied And Engineering Mathematics, 12(4), 1311-1321.Abstract
A set W ? E is said to be an edge-to-vertex Steiner dominating set of G if W is both an edge-to-vertex dominating set and a edge-to-vertex Steiner set of G. The edge-to-vertex Steiner domination number ?sev(G) of G is the minimum cardinality of its edge-to-vertex Steiner dominating set of G and any edge-to-vertex Steiner dominating set of cardinality ?sev(G) is a ?sev-set of G. Some general properties satisfied by this concept are studied. The edge-to-vertex Steiner domination number of certain classes of graphs are determined. Connected graph of size q ? 3 with edge-to-vertex Steiner domination number q or q ?1 are characterized. It is shown for every pair a, b of integers with 2 ? a ? b, there exists a connected graph G such that ?ev(G) = a and ?sev(G) = b.
Volume
12Issue
4URI
https://hdl.handle.net/11729/4942http://jaem.isikun.edu.tr/web/index.php/archive/117-vol12no4/914
Collections
The following license files are associated with this item:
Related items
Showing items related by title, author, creator and subject.
-
On zagreb indices of double vertex graphs
Kumar, Sanjay Sampath; Sundareswaran, Raman; Sundarakannan, Mahilmaran (Işık University Press, 2020)Let G = (V, E) be a graph with at least 2 vertices, then the double vertex graph U?(G) is the graph whose vertex set consists of all 2-subsets of V such that two distinct vertices {x, y} and {u, v} are adjacent if and only ... -
On total vertex-edge domination
Şahin, Bünyamin; Şahin, Abdulgani (Işık University Press, 2019)In this paper we obtain an improved upper bound of total vertex edgedomination number of a tree. If T is a connected tree with order n, then ????(T) ? m/3 with m = 6[ n/6] and we characterize the trees attaining this upper ... -
Even vertex odd mean labeling of transformed trees
Jeyanthi, Pon; Ramya, D.; Selvi, M. (Işık University Press, 2020)Let G = (V;E) be a graph with p vertices and q edges. A graph G is said have an even vertex odd mean labeling if there exists a function f: V (G) →{0; 2; 4;:::; 2q} satisfying f is 1-1 and the induced map f*: E(G) → {1; ...