Vertex Semi Middle Domination in Graphs

Prasad, K. C.

doi:10.5373/jardcs/v12i8/20202449

Search citation statements

Order By: Relevance

Paper Sections

Select...

Preliminaries1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2022

Publication Types

Select...

Article1

Relationship

Self Cite0

Independent1

Authors

Journals

Cited by 1 publication

(1 citation statement)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Theorem 2.3: [26] We begin with some observations. Proof: Consider 𝐺 = 𝑃 𝑛 and 𝑉(𝑃 𝑛 ) = {𝑣 𝑖 , 1 ≤ 𝑖 ≤ 𝑛} for 𝑛 ≥ 3.…”

Section: Preliminariesmentioning

confidence: 99%

Nonsplit domination number in vertex semi-middle graph

KM¹,

KC²,

Goudar³

2022

Int. J. Stat. Appl. Math.

View full text Add to dashboard Cite

Let 𝐺(𝑝, 𝑞) be a connected graph and 𝑀 𝑣 (𝐺) be its corresponding vertex semi middle graph. A dominating set 𝐷 ⊆ 𝑉[𝑀 𝑣 (𝐺)] is Nonsplit dominating set 〈𝑉[𝑀 𝑣 (𝐺)] − 𝐷〉 is connected. The minimum size of D is called the Nonsplit domination number of 𝑀 𝑣 (𝐺) and is denoted by 𝛾 𝑛𝑠 [𝑀 𝑣 (𝐺)]. In this paper we obtain several results on Nonsplit domination number.

show abstract

“…Theorem 2.3: [26] We begin with some observations. Proof: Consider 𝐺 = 𝑃 𝑛 and 𝑉(𝑃 𝑛 ) = {𝑣 𝑖 , 1 ≤ 𝑖 ≤ 𝑛} for 𝑛 ≥ 3.…”

Section: Preliminariesmentioning

confidence: 99%