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.
Cilt
12Sayı
4Bağlantı
http://belgelik.isikun.edu.tr/xmlui/handle/iubelgelik/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 ... -
New bounds on recent topological indices of graphs
Basavanagoud, Bommanahal; Veerapur, Goutam (Işık University Press, 2024-10)The Geometric-Harmonic index GH(ζ) of a simple graph ζ is defined as the sum of the terms (dζ(f)+dζ(g))√dζ(f)·dζ(g)/2 over all edges fg of ζ and the modified first Kulli-Basava index KB*₁ of a simple graph ζ is defined as ... -
Vertex and edge-vertex graceful labeling on neutrosophic graphs
Vetrivel, Govindan; Mullai, Murugappan (Işık University Press, 2025-02-01)A graph G with gracefully numbered labels is known as graceful labeling. An intuitionistic fuzzy graph/ neutrosophic graph, which admits graceful labeling, and if all vertex labels are distinct by each membership, then the ...