International audienceA decomposition of a graph G is a collection of its edge disjoint sub-graphs such that their union is G. A path decomposition of a graph is a decomposition of it into paths. In this paper, we define the pendant number Π p as the minimum number of end vertices of paths in a path decomposition of G and determine this parameter for certain fundamental graph classes
Abstract: Let G = (V, E) be a simple graph on the vertex set V . In a graph G, A set S ⊆ V is a domi...
By a graph G = (V,E), we mean a finite and undirected graph without loops and multiple edges. A grap...
AbstractIn this paper we present some results for path partition number π(G) in graphs G with toughn...
A path decomposition of a graph is a collection of its edge disjoint paths whose union is G. The pen...
A decomposition of a graph G is a collection ψ of subgraphs H1,H2, . . . , Hr of G such that every e...
Let be a simple, finite and undirected graph. The set of is called a dominating set of if ea...
A path-decomposition of a graph is a partition of its edges into subgraphs each of which is a path o...
The concepts of detour d-critical graphs, detour d-decreasing graphs, detour d-increasing graphs, de...
Here we impose parity condition on lengths of the paths and define an equiparity path cover as follo...
The domination number γ(G) of a graph G is the minimum number of vertices in a set D such that every...
Let G = (V, E) be a simple connected graph of order p and size q. A decomposition of a graph G is a ...
AbstractThe total domination number of a graph G without isolated vertices is the minimum number of ...
AbstractA tree decomposition of a graph G is a family of subtrees whose sets of edges partition the ...
The path number of a graph G is the number of paths in any pathos. The path number of a tree T equal...
For a positive integer k, a k-subdominating function of a graph G =(V,E) is a function f:V →{−1; 1} ...
Abstract: Let G = (V, E) be a simple graph on the vertex set V . In a graph G, A set S ⊆ V is a domi...
By a graph G = (V,E), we mean a finite and undirected graph without loops and multiple edges. A grap...
AbstractIn this paper we present some results for path partition number π(G) in graphs G with toughn...
A path decomposition of a graph is a collection of its edge disjoint paths whose union is G. The pen...
A decomposition of a graph G is a collection ψ of subgraphs H1,H2, . . . , Hr of G such that every e...
Let be a simple, finite and undirected graph. The set of is called a dominating set of if ea...
A path-decomposition of a graph is a partition of its edges into subgraphs each of which is a path o...
The concepts of detour d-critical graphs, detour d-decreasing graphs, detour d-increasing graphs, de...
Here we impose parity condition on lengths of the paths and define an equiparity path cover as follo...
The domination number γ(G) of a graph G is the minimum number of vertices in a set D such that every...
Let G = (V, E) be a simple connected graph of order p and size q. A decomposition of a graph G is a ...
AbstractThe total domination number of a graph G without isolated vertices is the minimum number of ...
AbstractA tree decomposition of a graph G is a family of subtrees whose sets of edges partition the ...
The path number of a graph G is the number of paths in any pathos. The path number of a tree T equal...
For a positive integer k, a k-subdominating function of a graph G =(V,E) is a function f:V →{−1; 1} ...
Abstract: Let G = (V, E) be a simple graph on the vertex set V . In a graph G, A set S ⊆ V is a domi...
By a graph G = (V,E), we mean a finite and undirected graph without loops and multiple edges. A grap...
AbstractIn this paper we present some results for path partition number π(G) in graphs G with toughn...
View in ORKG
DOI