Cycle Neighbor Polynomial of Graphs

Authors

  • Annie Sabitha Paul Department of Mathematics, Government College of Engineering, Kannur, Kerala
  • Raji Pilakkat Department of Mathematics, University of Calicut, Kerala

DOI:

https://doi.org/10.26713/cma.v11i4.1441

Keywords:

Cycle neighbor free vertex, Cycle neighbor polynomial of a graph

Abstract

In this paper, a new univariate graph polynomial called Cycle Neighbor Polynomial \(CN[G;x]\) of a graph \(G\) is introduced. We obtain some interesting properties of this polynomial and compute cycle neighbor polynomial of some specific graphs.

Downloads

Download data is not yet available.

References

J. A. Bondy and U. S. R. Murty, Graph Theory with Applications, North-Holland/Elsevier, New York (1976), https://www.zib.de/groetschel/teaching/WS1314/BondyMurtyGTWA.pdf.

J. A. Bondy, Pancyclic graphs I, Journal of Combinatorial Theory, Series B 11 (1971), 80 – 84, DOI: 10.1016/0095-8956(71)90016-5.

P. K. Deb and N. B. Limaye, On harmonious labelling of some cycle related graphs, Ars Combinatoria 65 (2002), 177 – 197.

J. A. Gallian, A dynamic survey of graph labelling, The Electronic Journal of Combinatorics, Article number DS6: December 21, 2018, https://www.combinatorics.org/files/Surveys/ds6/ds6v21-2018.pdf.

F. Harary, Graph Theory, Addison Wesley, Reading MA (1969).

J. J. Jesintha and K. E. Hilda, All uniform bowgraphs are graceful, Mathematics in Computer Science 9 (2015), 185 – 191, DOI: 10.1007/s11786-015-0224-2.

B. B. Moshe, M. Segal, A. Dvir and A. Tamir, Centdian computation in cactus graphs, Journal of Graph Algorithms and Applications 16 (2012), 199 – 224, DOI: 10.7155/jgaa.00255.

D. B. West, Introduction to Graph Theory, 2nd edition, Englewood Cliffs, Prentice Hall, NJ (2000), URL: http://docshare01.docshare.tips/files/26167/261678089.pdf.

Downloads

Published

31-12-2020
CITATION

How to Cite

Paul, A. S., & Pilakkat, R. (2020). Cycle Neighbor Polynomial of Graphs. Communications in Mathematics and Applications, 11(4), 549–558. https://doi.org/10.26713/cma.v11i4.1441

Issue

Section

Research Article