Ara
Toplam kayıt 2, listelenen: 1-2
On hubtic and restrained hubtic of a graph
(Işık University Press, 2019-05-07)
In this article, the hubtic number of the join and corona of two connected graphs is computed. The restrained hubtic number ξr(G) of a graph G is the maximum number such that we can partition V (G) into pairwise disjoint ...
Neighborhub number of graphs
(Işık University Press, 2022)
Let G be a graph. A neighborhub set (n-hub set) S of G is a set of vertices with the property that for any pair of vertices outside of S, there is a path between them with all intermediate vertices in S and G = S Uv∈S < ...