By a graph G = (V,E), we mean a finite and undirected graph without loops and multiple edges. A graph G with p vertices and q edges is called a (p, q) graph, the number p is referred to as the order of a graph G and q is referred to as the size of a graph G
For a graph G let \mu (G) denote the cyclomatic number and let \nu (G) denote the maximum number of ...
This paper is about edge H-domination of the graph. The edge H-dominating set is defined and the cha...
Let λ(G) denote the smallest number of vertices that can be removed from a non-empty graph G so tha...
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...
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...
In this paper, we give the results for the hub numbers of the join and corona of two connected graph...
A split hub set S in a graph G is a hub set such that the induced subgraph hV \ Si is disconnected. ...
In this article, the hubtic number of the join and corona of two connected graphs is computed. The r...
In this paper, we introduced the concepts of hub number in fuzzy graph and is denoted by h(G). The h...
Let G be a graph. A neighborhub set (n-hub set) S of G is a set of vertices with the property that f...
AbstractWe prove sharp bounds concerning domination number, radius, order and minimum degree of a gr...
summary:The total edge-domatic number of a graph is introduced as an edge analogue of the total doma...
Let $G$ be a graph of order $n$. The maximum and minimum degree of $G$ are denoted by $\Delta$ and $...
A subset \( H \subseteq V (G) \) of a graph \(G\) is a hop dominating set (HDS) if for every \({v\in...
For a graph G let \mu (G) denote the cyclomatic number and let \nu (G) denote the maximum number of ...
This paper is about edge H-domination of the graph. The edge H-dominating set is defined and the cha...
Let λ(G) denote the smallest number of vertices that can be removed from a non-empty graph G so tha...
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...
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...
In this paper, we give the results for the hub numbers of the join and corona of two connected graph...
A split hub set S in a graph G is a hub set such that the induced subgraph hV \ Si is disconnected. ...
In this article, the hubtic number of the join and corona of two connected graphs is computed. The r...
In this paper, we introduced the concepts of hub number in fuzzy graph and is denoted by h(G). The h...
Let G be a graph. A neighborhub set (n-hub set) S of G is a set of vertices with the property that f...
AbstractWe prove sharp bounds concerning domination number, radius, order and minimum degree of a gr...
summary:The total edge-domatic number of a graph is introduced as an edge analogue of the total doma...
Let $G$ be a graph of order $n$. The maximum and minimum degree of $G$ are denoted by $\Delta$ and $...
A subset \( H \subseteq V (G) \) of a graph \(G\) is a hop dominating set (HDS) if for every \({v\in...
For a graph G let \mu (G) denote the cyclomatic number and let \nu (G) denote the maximum number of ...
This paper is about edge H-domination of the graph. The edge H-dominating set is defined and the cha...
Let λ(G) denote the smallest number of vertices that can be removed from a non-empty graph G so tha...
DOI
Add to ORKG