The open hub number of a graph

Downloads

DOI:

https://doi.org/10.26637/MJM0804/0006

Abstract

Let G=(V,E)G=(V,E) be a connected graph. A subset HH of VV is called a hub set of GG if for any two distinct vertices u,vVHu,vVH, there exists a uvuv path PP in GG such that all the internal vertices of PP are in HH. A hub set HH of VV is called an open hub set if the induced sub graph HH has no isolated vertices. The minimum cardinality of an open hub set of GG is called the open hub number of GG and is denoted by hO(G)hO(G). In this paper, we present several basic results on the open hub number.

Keywords:

Open hub set, Open hub number

Mathematics Subject Classification:

Matheatics
  • Pages: 1375-1377
  • Date Published: 01-10-2020
  • Vol. 8 No. 04 (2020): Malaya Journal of Matematik (MJM)

F. Harary, Graph Theory, Addison-Wesley Pub House, 1963.

C. Gary and Z. Ping, Introduction to Graph Theory, Tata McGraw-Hill, 2006.

W. Matthew, The hub number graphs, International Journal of Mathematics and Computer Science, 1(2006), $117-$ 124.

W.H. Teresa, T.H. Stephan and J.S. Peter, Fundamentals of Domination in Graphs, Marcel Dekker, Inc, 2008.

G. Tracy, A.H. Stephan and J. Adam, The hub number of a graph, Information Processing Letters, 108(2008), 226-228.

  • NA

Similar Articles

<< < 1 2 3 4 5 > >> 

You may also start an advanced similarity search for this article.

Metrics

PDF views
43
Jan 2021Jul 2021Jan 2022Jul 2022Jan 2023Jul 2023Jan 2024Jul 2024Jan 2025Jul 2025Jan 20267.0
|

Published

01-10-2020

How to Cite

Ragi Puthan Veettil, and T.V. Ramakrishnan. “The Open Hub Number of a Graph”. Malaya Journal of Matematik, vol. 8, no. 04, Oct. 2020, pp. 1375-7, doi:10.26637/MJM0804/0006.