<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.2d1 20170631//EN" "JATS-journalpublishing1.dtd">
<ArticleSet>
  <Article>
    <Journal>
      <PublisherName>ijesm</PublisherName>
      <JournalTitle>International Journal of Engineering, Science and</JournalTitle>
      <PISSN>I</PISSN>
      <EISSN>S</EISSN>
      <Volume-Issue>Volume 6, Issue 5</Volume-Issue>
      <PartNumber/>
      <IssueTopic>Multidisciplinary</IssueTopic>
      <IssueLanguage>English</IssueLanguage>
      <Season>September 2017</Season>
      <SpecialIssue>N</SpecialIssue>
      <SupplementaryIssue>N</SupplementaryIssue>
      <IssueOA>Y</IssueOA>
      <PubDate>
        <Year>-0001</Year>
        <Month>11</Month>
        <Day>30</Day>
      </PubDate>
      <ArticleType>Engineering, Science and Mathematics</ArticleType>
      <ArticleTitle>Not all wheel graphs were Edge-graceful</ArticleTitle>
      <SubTitle/>
      <ArticleLanguage>English</ArticleLanguage>
      <ArticleOA>Y</ArticleOA>
      <FirstPage>170</FirstPage>
      <LastPage>173</LastPage>
      <AuthorList>
        <Author>
          <FirstName>S.Venkatesan1</FirstName>
          <AuthorLanguage>English</AuthorLanguage>
          <Affiliation/>
          <CorrespondingAuthor>N</CorrespondingAuthor>
          <ORCID/>
          <FirstName/>
          <LastName>P.Sekar.2</LastName>
          <AuthorLanguage>English</AuthorLanguage>
          <Affiliation/>
          <CorrespondingAuthor>Y</CorrespondingAuthor>
          <ORCID/>
        </Author>
      </AuthorList>
      <DOI/>
      <Abstract>Graceful labeling is assignment of distinct labels from f {0,…., |E|} to vertices of graph, where edges are labeled by difference of absolute values of adjacent vertices and every label from f {1,2,….,|E|}  is used exactly once as an edge label. Edge – graceful graphs were defined by Sheng-Ping in 1985 is originated from graceful graphs. In fact, edge – gracefulness is reversal of gracefulness. It involves labeling edges, rather than vertices, with an induced numbering consisting of sums of edge- labels, rather than differences of vertex labels. In this paper, we are discussing about the edge graceful labeling of wheel graphs and related results</Abstract>
      <AbstractLanguage>English</AbstractLanguage>
      <Keywords>graph labeling, graceful labeling, edge - graceful labeling, wheel graph.</Keywords>
      <URLs>
        <Abstract>https://ijesm.co.in/ubijournal-v1copy/journals/abstract.php?article_id=3445&amp;title=Not all wheel graphs were Edge-graceful</Abstract>
      </URLs>
      <References>
        <ReferencesarticleTitle>References</ReferencesarticleTitle>
        <ReferencesfirstPage>16</ReferencesfirstPage>
        <ReferenceslastPage>19</ReferenceslastPage>
        <References/>
      </References>
    </Journal>
  </Article>
</ArticleSet>