The edge-to-vertex Steiner domination number of a graph
Künye
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.Özet
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.
Kaynak
TWMS Journal Of Applied And Engineering MathematicsCilt
12Sayı
4Bağlantı
https://hdl.handle.net/11729/4942http://jaem.isikun.edu.tr/web/index.php/archive/117-vol12no4/914
Koleksiyonlar
Aşağıdaki lisans dosyası bu öğe ile ilişkilidir:
İlgili Öğeler
Başlık, yazar, küratör ve konuya göre gösterilen ilgili öğeler.
-
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 ... -
Total vertex irregularity strength of interval graphs
Rana, Akul (Işık University Press, 2021)A labeling of a graph is a mapping that maps some set of graph elements to a set of numbers (usually positive integers). For a simple graph G = (V, E) with vertex set V and edge set E, a labeling φ : V ∪E → {1, 2, ..., k} ... -
Connected majority domination vertex critical graphs
Manora, J. Joseline; Vairavel, T. Muthukani (Işık University Press, 2021)In this article, how the removal of a single vertex from a graph G can change the Connected Majority Domination number is surveyed for any graph G. A graph is Connected Domination Critical if the removal of any vertex ...