On Hub Domination Number of Transformation Graphs

Authors

  • T. Anitha Baby, T. Abiah

Keywords:

Hub dominating set, Hub domination number, Transformation graph.

Abstract

For a graph G, a set H⊆V is a hub dominating set if every vertex u in V-H is adjacent to a vertex v∈H and any two non-adjacent vertices u ,w in V-H has a path in G in which all the internal vertices of the path must be in H. The least cardinality taken over all hub dominating set H of vertices in graph G is known as the hub domination number. We denote the hub domination number of G by γ_h (G).

Downloads

Download data is not yet available.

References

C. Berge, Theory of Graph and its Applications, Dunod, Paris (1958).

Harary. D. (1969). Graph Theory. Addison-Wesley Publishing Company, Newyork.

O.Ore. Theory of Graphs. Amer, Math Soc Colloquim Pub. Amer. Math. Soc. Providence, Rhode Island, 38(1967), 206.

Walsh, Mathew, The Hub Number of a Graph, Int. J. Math. Comput Sci, no 1(2006): 117-124

Wu, Bayoyindureng, and Meng Ji-xiang. "Basic properties of total transformation graphs." Journal of Mathematical Study 34(2) (2001): 109-116.

Downloads

Published

19.06.2024

How to Cite

T. Anitha Baby. (2024). On Hub Domination Number of Transformation Graphs. International Journal of Intelligent Systems and Applications in Engineering, 12(4), 6009 –. Retrieved from https://ijisae.org/index.php/IJISAE/article/view/8108

Issue

Section

Research Article