Scholars Central

Research articlePublished 19 Jun 2018

S-PATH DOMINATION IN SHADOW DISTANCE GRAPHS

Authors: Vijayachandra Kumar U, R Murali

Journal of Harmonized Research in Applied Science

Volume 6 · Issue 3 · Pages 194–199

Ask about this article

Abstract

Select any words in the title or abstract, or press this and choose a sentence.

Let G = (V,E) be a simple connected and undirected graph. A subset D of V is called a dominating set of G if every vertex not in D is adjacent to some vertex in D. The domination number of G denoted b y is the minimal cardinality taken over all dominating sets of G. A dominating set of G is called a s-path dominating set of G if every path of length s in G has at least one vertex in this dominating set. We denote a s-path dominating set by . The s-path domination number of G denoted by is the minimal cardinality taken over all s - path dominating sets of G. In this paper, we determine s - path domination number of the shadow distance graph of the path graph with specified distance sets.

Ask about this article

Answers come only from this article's title, abstract and keywords, each sentence pointing to where it comes from. Your question is sent to OpenAI to write the answer. Scholars Central does not store it.

Try:

Similar by topic

More from this journal

The newest in Journal of Harmonized Research in Applied Science.

All its articles

Follow

New articles from what you follow go into your email digest, once you agree to alert emails.

  • JournalJournal of Harmonized Research in Applied Science
  • BylineArticles whose byline prints “Vijayachandra Kumar U”
  • BylineArticles whose byline prints “R Murali”

For authors and organisers

Publish, present and keep up with your field

Find the right journal for your paper and submit your manuscript.

Photo: Pexels