he 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$
Domination is a well-known graph theoretic concept due to its significant real-world applications in...
In this paper, we give the results for the hub numbers of the join and corona of two connected graph...
This thesis contains new contributions to Ramsey theory, in particular results that establish exact ...
The maximum order of partition of the vertex set \(V(G)\) into hub sets is called hubtic number of \...
By a graph G = (V,E), we mean a finite and undirected graph without loops and multiple edges. A grap...
In this article, the hubtic number of the join and corona of two connected graphs is computed. The r...
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...
Graph polynomials are polynomials assigned to graphs. Interestingly, they also arise in many areas o...
In this paper, we introduced the concepts of hub number in fuzzy graph and is denoted by h(G). The h...
A split hub set S in a graph G is a hub set such that the induced subgraph hV \ Si is disconnected. ...
summary:A subset $D$ of the vertex set $V(G)$ of a graph $G$ is called point-set dominating, if for ...
A set of vertices S in a graph G = (V, E) is a dominating set if every vertex not in S is adjacent t...
In a graph G = (V, E) each vertex is said to dominate every vertex in its closed neighborhood. In a ...
The domination number of graph  is the smallest cardinality of the domination set of graph G. A sub...
The basis number b(G) of a graphG is defined to be the least integer k such thatG has a k-fold basis...
Domination is a well-known graph theoretic concept due to its significant real-world applications in...
In this paper, we give the results for the hub numbers of the join and corona of two connected graph...
This thesis contains new contributions to Ramsey theory, in particular results that establish exact ...
The maximum order of partition of the vertex set \(V(G)\) into hub sets is called hubtic number of \...
By a graph G = (V,E), we mean a finite and undirected graph without loops and multiple edges. A grap...
In this article, the hubtic number of the join and corona of two connected graphs is computed. The r...
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...
Graph polynomials are polynomials assigned to graphs. Interestingly, they also arise in many areas o...
In this paper, we introduced the concepts of hub number in fuzzy graph and is denoted by h(G). The h...
A split hub set S in a graph G is a hub set such that the induced subgraph hV \ Si is disconnected. ...
summary:A subset $D$ of the vertex set $V(G)$ of a graph $G$ is called point-set dominating, if for ...
A set of vertices S in a graph G = (V, E) is a dominating set if every vertex not in S is adjacent t...
In a graph G = (V, E) each vertex is said to dominate every vertex in its closed neighborhood. In a ...
The domination number of graph  is the smallest cardinality of the domination set of graph G. A sub...
The basis number b(G) of a graphG is defined to be the least integer k such thatG has a k-fold basis...
Domination is a well-known graph theoretic concept due to its significant real-world applications in...
In this paper, we give the results for the hub numbers of the join and corona of two connected graph...
This thesis contains new contributions to Ramsey theory, in particular results that establish exact ...
DOI
Add to ORKG