International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
|
Volume 183 - Issue 52 |
Published: Feb 2022 |
Authors: Abdu-Alkafi Saead Sand, Sultan Senan Mahde |
![]() |
Abdu-Alkafi Saead Sand, Sultan Senan Mahde . Hop Hubtic Number and Hop Hub Polynomial of Graphs. International Journal of Computer Applications. 183, 52 (Feb 2022), 1-5. DOI=10.5120/ijca2022921938
@article{ 10.5120/ijca2022921938, author = { Abdu-Alkafi Saead Sand,Sultan Senan Mahde }, title = { Hop Hubtic Number and Hop Hub Polynomial of Graphs }, journal = { International Journal of Computer Applications }, year = { 2022 }, volume = { 183 }, number = { 52 }, pages = { 1-5 }, doi = { 10.5120/ijca2022921938 }, publisher = { Foundation of Computer Science (FCS), NY, USA } }
%0 Journal Article %D 2022 %A Abdu-Alkafi Saead Sand %A Sultan Senan Mahde %T Hop Hubtic Number and Hop Hub Polynomial of Graphs%T %J International Journal of Computer Applications %V 183 %N 52 %P 1-5 %R 10.5120/ijca2022921938 %I Foundation of Computer Science (FCS), NY, USA
The maximum order of partition of the vertex set V (G) into vertex hop hub sets is called hop hubtic number of G and denoted by h?(G). In this paper the hop hubtic number of some standard graphs was determined. Also bounds for h?(G) were obtained. The hop hub polynomial of a connected graph G was introduced. The hop hub polynomial of a connected graph G of order n is the polynomial Hh(G, x) = |VX(G)| i=hh(G) hh(G, i)xi, where hh(G, i) denotes the number of hop hub sets of G of cardinality i and hh(G) is the hop hub number of G. Finally, the hop hub polynomial of some special classes of graphs was studied.