This article exposes the combinatorial formula that determines the pathdomination number in a grid graph and discusses some of its properties. Seven propertiesare derived regarding the path domination number of grid graphs. Furthermore, some additional properties as direct consequences of the derived main properties are alsodiscussed
A subset of vertices of a simple connected graph is a neighborhood set (n-set) of G if G is the un...
The sum cordial labeling is a variant of cordial labeling. In this paper, we investigate 3-Total Sup...
For every connected graph G, the triangle free detour distance D∆f(u, v) is the length of a longest ...
This article exposes the combinatorial formula that determines the pathdomination number in a grid g...
The directed Zero divisor graph is a graph constructed out of a non-Commutative ring R and its non-z...
Systo and Topp introduced the notions of generalized line, middle and total graphs and they studied ...
Let be a geodetic cototal domination set of . A subset is called a forcing subset for if is the ...
In this paper, we introduce a new concept Steiner domination decomposition number of graphs. Let be...
A set of vertices in a graph dominates if every vertex in is either in or adjacent to a vertex ...
A set is detour monophonic convexif The detour monophonic convexity number is denoted by is the c...
In this paper, we first define the Neutrosophic tree using the concept of the strong cycle. We then ...
Let G = (V,E) be any graph with nvertices and medges. An edge dominating set which intersects every ...
Let G=(V,E)\ be a connected graph. Let D be a minimum dominating set in G.\ If V-D contains a domina...
Let be a simple graph on the vertex set . In a graph G, A set is a dominating set of G if every ...
A diverging unidirectional perfect binary tree is a unidirectional perfect binary tree in which ever...
A subset of vertices of a simple connected graph is a neighborhood set (n-set) of G if G is the un...
The sum cordial labeling is a variant of cordial labeling. In this paper, we investigate 3-Total Sup...
For every connected graph G, the triangle free detour distance D∆f(u, v) is the length of a longest ...
This article exposes the combinatorial formula that determines the pathdomination number in a grid g...
The directed Zero divisor graph is a graph constructed out of a non-Commutative ring R and its non-z...
Systo and Topp introduced the notions of generalized line, middle and total graphs and they studied ...
Let be a geodetic cototal domination set of . A subset is called a forcing subset for if is the ...
In this paper, we introduce a new concept Steiner domination decomposition number of graphs. Let be...
A set of vertices in a graph dominates if every vertex in is either in or adjacent to a vertex ...
A set is detour monophonic convexif The detour monophonic convexity number is denoted by is the c...
In this paper, we first define the Neutrosophic tree using the concept of the strong cycle. We then ...
Let G = (V,E) be any graph with nvertices and medges. An edge dominating set which intersects every ...
Let G=(V,E)\ be a connected graph. Let D be a minimum dominating set in G.\ If V-D contains a domina...
Let be a simple graph on the vertex set . In a graph G, A set is a dominating set of G if every ...
A diverging unidirectional perfect binary tree is a unidirectional perfect binary tree in which ever...
A subset of vertices of a simple connected graph is a neighborhood set (n-set) of G if G is the un...
The sum cordial labeling is a variant of cordial labeling. In this paper, we investigate 3-Total Sup...
For every connected graph G, the triangle free detour distance D∆f(u, v) is the length of a longest ...
DOI
Add to ORKG