23
Views
0
CrossRef citations to date
0
Altmetric
Research Article

Full-edge friendly index sets of fan

&
Pages 299-306 | Received 01 May 2020, Published online: 05 Jan 2021

References

  • Ringel G. Problem 25 in theory of graphs and its applications. In Proceedings of Symposium Smolenice, 1963: 162-167.
  • Rosa A. On certain valuations of the vertices of a graph. In McMaster University, 1966: 349-355.
  • Ringel G, The combinatorial map color theorem, Journal of Graph Theory, 1(1997)141-155, DOI:10.1002/jgt.3190010210.
  • I. Cahit, Cordial graphs: a weaker version of graceful and harmonious graphs, Ars Combinatoria, 23(1987):201-207.
  • S M. Lee, H. K. Ng, On friendly index sets of bipartite graphs, Ars Combinatoria, 86(2008)86: 257-271.
  • D. Sinha, J. Kaur, Region indices of friendly labeling of a planar graph, Utilitas Mathematica, 101(2016)149-178.
  • D. Sinha, J. Kaur, Full friendly index set-I, Discrete Applied Mathematics, 161(2013)1262-1274, DOI: 10.1016/j.dam.2012.10.028
  • D. Sinha, J. Kaur, Edge friendly Labelings of the graph-I, Centre for Mathematical Sciences, 2017, 76(34): 1-14.
  • D. Sinha, J. Kaur, Region indices of edge-friendly labeling of a plane graph, Utilitas Mathematica, 99(2016)187-213.
  • Zhen-Bin Gao, Gee-Choon Lau and Sin-Min Lee, On friendly index and product-cordial index sets of Möbius-liked graph, Journal of Discrete Mathematical Sciences and Cryptography, 21(2018)647-659, DOI: 10.1080/09720529.2016.1220089.
  • D. Sinha, J. Kaur, Edge-friendly labelings of graph - II, Utilitas mathematica, 99(2016)251-257.
  • Shiu W C, Extreme edge-friendly indices of complete bipartite graphs, Transactions on Combinatorica, 5(2016)11-109.
  • Kwong H, Lee S M, Ng H K, On friendly index sets of 2-regular graphs, Discrete Mathematics, 308(2008)5522-5532. DOI: 10.1016/j.disc.2007.10.018

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.