Some new families of e-cordial graphs

HIGHLIGHTS

  • who: A Subject classification number and collaborators from the Saurashtra University Rajkot, GUJARAT, India have published the research work: Some New Families of E-Cordial Graphs, in the Journal: (JOURNAL)
  • what: In this paper some new families E-cordial graphs are investigated.

SUMMARY

    Definition: If the vertices are assigned values subject to certain conditions then it is known as graph labeling. For detailed survey on graph labeling the authors refer to A Dynamic Survey of Graph Labeling by_(Gallian,J.,2010). A graph which admits graceful labeling is called a graceful . . .

     

    Logo ScioWire Beta black

    If you want to have access to all the content you need to log in!

    Thanks :)

    If you don't have an account, you can create one here.

     

Scroll to Top

Add A Knowledge Base Question !

+ = Verify Human or Spambot ?