AbstractA graph is bivariegated if its vertex set can be partitioned into two equal sets such that each vertex is adjacent to one and only one vertex in the set not containing it. A tree with 2 n vertices is bivariegated if and only if the largest independent subset of the vertex set has cardinal n. A constructive description of such trees as well as a listing of all those with 12 or fewer vertices is given
AbstractA graph is said to be k-variegated if its vertex set can be partitioned into k equal parts s...
AbstractA paired-dominating set of a graph G is a dominating set of vertices whose induced subgraph ...
A paired-dominating set of a graph G is a dominating set of vertices whose induced subgraph has a pe...
AbstractA graph is bivariegated if its vertex set can be partitioned into two equal sets such that e...
AbstractThe notion of balanced bipartitions of the vertices in a tree T was introduced and studied b...
A Spanning tree of a graph G is a subgraph that is a tree which concludes all of the vertices of G. ...
AbstractIn this paper we shall show that if G = (V, E) is a bipartite graph with more than (a − 1)‖Y...
In a graph G = (V, E), a vertex dominates itself and its neighbors. A subset S of vertices of V is a...
A total edge dominating set of a graph G is a set D of edges of G such that the sub graph D has no i...
AbstractA 2-binary tree is a binary rooted tree whose root is colored black and the other vertices a...
AbstractA bijection is introduced between ordered trees and bicoloured ordered trees, which maps lea...
summary:A set $S$ of vertices in a graph $G$ is called a paired-dominating set if it dominates $V$ a...
Abstract. A vertex of a graph is said to dominate itself and all of its neighbors. A subset D ⊆ V (G...
In a graph G, a vertex dominates itself and its neighbors. A subset S of vertices of G is a double d...
A paired-dominating set of a graph G is a dominating set of vertices whose induced subgraph has a pe...
AbstractA graph is said to be k-variegated if its vertex set can be partitioned into k equal parts s...
AbstractA paired-dominating set of a graph G is a dominating set of vertices whose induced subgraph ...
A paired-dominating set of a graph G is a dominating set of vertices whose induced subgraph has a pe...
AbstractA graph is bivariegated if its vertex set can be partitioned into two equal sets such that e...
AbstractThe notion of balanced bipartitions of the vertices in a tree T was introduced and studied b...
A Spanning tree of a graph G is a subgraph that is a tree which concludes all of the vertices of G. ...
AbstractIn this paper we shall show that if G = (V, E) is a bipartite graph with more than (a − 1)‖Y...
In a graph G = (V, E), a vertex dominates itself and its neighbors. A subset S of vertices of V is a...
A total edge dominating set of a graph G is a set D of edges of G such that the sub graph D has no i...
AbstractA 2-binary tree is a binary rooted tree whose root is colored black and the other vertices a...
AbstractA bijection is introduced between ordered trees and bicoloured ordered trees, which maps lea...
summary:A set $S$ of vertices in a graph $G$ is called a paired-dominating set if it dominates $V$ a...
Abstract. A vertex of a graph is said to dominate itself and all of its neighbors. A subset D ⊆ V (G...
In a graph G, a vertex dominates itself and its neighbors. A subset S of vertices of G is a double d...
A paired-dominating set of a graph G is a dominating set of vertices whose induced subgraph has a pe...
AbstractA graph is said to be k-variegated if its vertex set can be partitioned into k equal parts s...
AbstractA paired-dominating set of a graph G is a dominating set of vertices whose induced subgraph ...
A paired-dominating set of a graph G is a dominating set of vertices whose induced subgraph has a pe...
DOI
Add to ORKG