Connected Hub Sets and Connected Hub Polynomials of the Lollipop Graph L_(p,1)

Authors

  • T Anggelinshiny Research Scholar (Reg. No. 20213282092009), Department of Mathematics, Women’s Christian College, Nagercoil, Tamil Nadu, India. Affiliated by Manonmaniam Sundaranar University, Abishekapatti, Tirunelveli - 627 012
  • Baby Anitha Assistant Professor, Department of Mathematics, Women’s Christian College, Nagercoil, Tamil Nadu, India. Affiliated by Manonmaniam Sundaranar University, Abishekapatti, Tirunelveli - 627 012

DOI:

https://doi.org/10.23755/rm.v44i0.886

Keywords:

Lollipop Graph, connected hub set, connected hub number, Connected hub polynomial

Abstract

Let  be a graph with vertex set . The number of vertices in  is the order of  and is denoted by . The connected hub polynomial of Gdenoted by  is defined as  where  denotes the number of connected hub sets of  of cardinality and denotes the connected hub number of .Let  denotes the Lollipop graph with  vertices. The connected hub polynomial of  denoted by  is defined as,where denotes the number of connected hub sets of  of cardinality , and denotes the connected hub number of .In this paper, we derive a recursive formula for . From this recursive formula, we construct the connected hub polynomial of  as,Also we study some properties of this polynomial

References

Walsh, Matthew, "THE HUB NUMBER OF A GRAPH", Int. J. Math. Comput. Sci 1, no. 1 (2006): 117-124.

Veettil, Ragi Puthan, and T. V. Ramakrishnan, "INTRODUCTION TO HUB POLYNOMIAL OF GRAPHS", Malaya Journal of Matematik (MJM) 8, no. 4, 2020 (2020): 1592-1596.

S. Alikhani and Y.H. Peng,"DOMINATING SETS AND DOMINATION POLYNOMIALS OF PATHS",International journal of Mathematics and mathematical sciences, 2009.

S. Alikhani and Y.H. Peng,"INTRODUCTION TO DOMINATION POLYNOMIAL OF A GRAPH ",arXiv preprint arXiv:0905.2251, 2009.

Sahib.Sh. Kahat, Abdul Jalil Khalaf and RoslanHasni,"DOMINATING SETS AND DOMINATION POLYNOMIALS OF WHEELS",Asian Journal of Applied Sciences(ISSN:2321- 0893),volume 02- Issue 03,June 2014.

Sahib.Sh. Kahat, Abdul Jalil M.Khalaf and RoslanHasni,"DOMINATING SETS AND DOMINATION POLYNOMIALS OF STARS",Australian Journal of Basics and Applied Science,8(6) June 2014,pp 383-386.

A.Vijayan,T.AnithaBaby,G.Edwin,"CONNECTED TOTAL DOMINATING SETS AND CONNECTED TOTAL DOMINATION POLYNOMIALS OF STARS AND WHEELS",IOSR Journal of Mathematics,VolumeII,pp 112-121.

Downloads

Published

2022-12-11

Issue

Vol. 44 (2022): Special Issue: Recent Trends in Mathematics and its Applications

Section

Volume 45-2023

License

This journal provides immediate open access to its content on the principle that making research freely available to the public supports a greater global exchange of knowledge. The journal is committed to real and immediate open access for academic work. All of the journal articles are free to access immediately from the date of publication. There are no charge for readers to download articles and reviews for their own scholarly use. Benefits of open access for authors, include:

  • Free access for all users worldwide
  • Increased visibility and readership
  • Rapid publication
  • No spatial constraints
  • Authors can share their research papers on their personal web-pages (i.e. ResearchGate, etc.)

Ratio Mathematica publishes open access articles under the terms of the Creative Commons Attribution (CC BY) License. The Creative Commons Attribution License (CC-BY) allows users to copy, distribute and transmit an article, adapt the article and make commercial use of the article. The CC BY license permits commercial and non-commercial re-use of an open access article, as long as the author is properly attributed. Copyright on any research article published by Ratio Mathematica is retained by the author(s). Authors grant Ratio Mathematica a license to publish the article and identify itself as the original publisher. Authors also grant any third party the right to use the article freely as long as its original authors, citation details and publisher are identified. 
For further information visit: https://creativecommons.org/licenses/by/3.0/. The following logo will appear in any paper that will be published from the volume number 31/2016 onwards.