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
Let G = (V, E) be a simple connected graph of order p and size q. A decomposition of a graph G is a ...
For a nontrivial connected graph G = (V(G),E(G)), a set S⊆ V(G) is called an edge geodetic set of G ...
Let G = (V(G), E(G)) be finite, undirected graph containing no loops nor multiple edges, with vertex...
By a graph G = (V,E), we mean a finite and undirected graph without loops and multiple edges. A grap...
By a graph G = (V,E), we mean a finite undirected graph without loops or multiple edges. The order a...
In this paper graphs are finite, simple and undirected. Let G be a (p, q) graph where p refers the n...
Throughout this paper, by a graph we mean a finite, undirected, simple graph. Let G(V,E) be a graph ...
By a graph G = (V,E) we mean a finite undirected connected graph without loops or multiple edges. Th...
he maximum order of partition of the vertex set V(G) into hub sets is called hubtic number of G and ...
In this article, we consider finite, undirected, simple and connected graphs G = (V,E) with vertex s...
The graph G = (V,E) we mean a finite, undirected graph with neither loops nor multiple edges. The or...
Number is based in special edges, is introduced. The kind of natural extension from edges toward ver...
A network is a collection of objects connected to each other in some specific way. A graph is a fini...
By a graph G=(V,E), we mean a finite, undirected connected graph without loops and multiple edges
A graph G = (V,E) is a structure which consists of a finite nonempty set V of vertices and a set E o...
Let G = (V, E) be a simple connected graph of order p and size q. A decomposition of a graph G is a ...
For a nontrivial connected graph G = (V(G),E(G)), a set S⊆ V(G) is called an edge geodetic set of G ...
Let G = (V(G), E(G)) be finite, undirected graph containing no loops nor multiple edges, with vertex...
By a graph G = (V,E), we mean a finite and undirected graph without loops and multiple edges. A grap...
By a graph G = (V,E), we mean a finite undirected graph without loops or multiple edges. The order a...
In this paper graphs are finite, simple and undirected. Let G be a (p, q) graph where p refers the n...
Throughout this paper, by a graph we mean a finite, undirected, simple graph. Let G(V,E) be a graph ...
By a graph G = (V,E) we mean a finite undirected connected graph without loops or multiple edges. Th...
he maximum order of partition of the vertex set V(G) into hub sets is called hubtic number of G and ...
In this article, we consider finite, undirected, simple and connected graphs G = (V,E) with vertex s...
The graph G = (V,E) we mean a finite, undirected graph with neither loops nor multiple edges. The or...
Number is based in special edges, is introduced. The kind of natural extension from edges toward ver...
A network is a collection of objects connected to each other in some specific way. A graph is a fini...
By a graph G=(V,E), we mean a finite, undirected connected graph without loops and multiple edges
A graph G = (V,E) is a structure which consists of a finite nonempty set V of vertices and a set E o...
Let G = (V, E) be a simple connected graph of order p and size q. A decomposition of a graph G is a ...
For a nontrivial connected graph G = (V(G),E(G)), a set S⊆ V(G) is called an edge geodetic set of G ...
Let G = (V(G), E(G)) be finite, undirected graph containing no loops nor multiple edges, with vertex...
DOI
Add to ORKG