The maximum order of partition of the vertex set \(V(G)\) into hub sets is called hubtic number of \(G\) and denoted by \(\xi(G)\). In this paper we determine the hubtic number of some standard graphs. Also we obtain bounds for \(\xi(G)\). And we characterize the class of all \((p,q)\) graphs for which \(\xi(G)=p\)
Let G be a graph. A neighborhub set (n-hub set) S of G is a set of vertices with the property that f...
A subset \( H \subseteq V (G) \) of a graph \(G\) is a hop dominating set (HDS) if for every \({v\in...
A set D ⊆ V (G) is a dominating set of G if every vertex not in D is adjacent to at least one vertex...
By a graph G = (V,E), we mean a finite and undirected graph without loops and multiple edges. A grap...
he maximum order of partition of the vertex set V(G) into hub sets is called hubtic number of G and ...
In this article, the hubtic number of the join and corona of two connected graphs is computed. The r...
In this paper, we give the results for the hub numbers of the join and corona of two connected graph...
Let G be a graph; a hub set H of G is a set of vertices with the property that for any pair of verti...
A split hub set S in a graph G is a hub set such that the induced subgraph hV \ Si is disconnected. ...
In this paper, we introduced the concepts of hub number in fuzzy graph and is denoted by h(G). The h...
summary:Let $k$ be a positive integer, and let $G$ be a simple graph with vertex set $V(G)$. A {\it ...
summary:A subset $D$ of the vertex set $V(G)$ of a graph $G$ is called point-set dominating, if for ...
Let $G$ be a graph of order $n$. The maximum and minimum degree of $G$ are denoted by $\Delta$ and $...
Let λ(G) denote the smallest number of vertices that can be removed from a non-empty graph G so tha...
AbstractA set S of vertices in a graph G is a dominating set of G if every vertex of V(G)∖S is adjac...
Let G be a graph. A neighborhub set (n-hub set) S of G is a set of vertices with the property that f...
A subset \( H \subseteq V (G) \) of a graph \(G\) is a hop dominating set (HDS) if for every \({v\in...
A set D ⊆ V (G) is a dominating set of G if every vertex not in D is adjacent to at least one vertex...
By a graph G = (V,E), we mean a finite and undirected graph without loops and multiple edges. A grap...
he maximum order of partition of the vertex set V(G) into hub sets is called hubtic number of G and ...
In this article, the hubtic number of the join and corona of two connected graphs is computed. The r...
In this paper, we give the results for the hub numbers of the join and corona of two connected graph...
Let G be a graph; a hub set H of G is a set of vertices with the property that for any pair of verti...
A split hub set S in a graph G is a hub set such that the induced subgraph hV \ Si is disconnected. ...
In this paper, we introduced the concepts of hub number in fuzzy graph and is denoted by h(G). The h...
summary:Let $k$ be a positive integer, and let $G$ be a simple graph with vertex set $V(G)$. A {\it ...
summary:A subset $D$ of the vertex set $V(G)$ of a graph $G$ is called point-set dominating, if for ...
Let $G$ be a graph of order $n$. The maximum and minimum degree of $G$ are denoted by $\Delta$ and $...
Let λ(G) denote the smallest number of vertices that can be removed from a non-empty graph G so tha...
AbstractA set S of vertices in a graph G is a dominating set of G if every vertex of V(G)∖S is adjac...
Let G be a graph. A neighborhub set (n-hub set) S of G is a set of vertices with the property that f...
A subset \( H \subseteq V (G) \) of a graph \(G\) is a hop dominating set (HDS) if for every \({v\in...
A set D ⊆ V (G) is a dominating set of G if every vertex not in D is adjacent to at least one vertex...
DOI
Add to ORKG