Scholars Central

Research articlePublished 27 Jul 2018

LINEAR PRIME LABELING OF SOME PATH RELATED DI GRAPHS

Authors: Sunoj B S, Mathew Varkey T K

Journal of Harmonized Research in Applied Science

Volume 6 · Issue 3 · Pages 213–216

Ask about this article

Abstract

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

Linear prime labeling of a graph is the labeling of the vertices with {0,1,2---,p-1} and the direct edges with twice the value of the terminal vertex plus value of the initial vertex. The greatest com mon incidence number of a vertex (gcin) of in degree greater than one is defined as the greatest common divisor of the labels of the incident edges[5]. If the gcin of each vertex of in degree greater than one is one, then the graph admits linear prime labeling[6]. Here we investigate some path related di graphs for linear prime labeling.

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:

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 “Sunoj B S”
  • BylineArticles whose byline prints “Mathew Varkey T K”