Scholars Central

Research articlePublished Oct 2013

SOME GRAPHS WITH n- EDGE MAGIC LABELING

Authors: Neelam Kumari, Seema Mehra

Ask about this article

Abstract

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

In this paper a new labeling known as n-edge magic labeling is introduced. Let G (V, E) be a graph, where V and E represents the set of vertices and edges respectively .We denote the graph G by G (p, q) , having p vertices and q edges. Graph, graph labeling, magic labeling, edge magic labeling, vertex magic labeling, 0-edgemagic labeling and 1-edge magic labeling have been discussed. It is proved that some graphs such as Pn, Cn (n being odd +ve integer) and many other graphs have n-edge magic labeling. In this paper the problem of graphs having n- edge magic labeling is studied.

Subjects

Engineering

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 International Journal of Innovative Research in Science, Engineering and Technology.

All its articles

Conferences in this field

Upcoming conferences in this field.

Follow

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

  • JournalInternational Journal of Innovative Research in Science, Engineering and Technology
  • SubjectEngineering
  • BylineArticles whose byline prints “Neelam Kumari”
  • BylineArticles whose byline prints “Seema Mehra”

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