AbstractThe notion of balanced bipartitions of the vertices in a tree T was introduced and studied by Reid (Networks 34 (1999) 264). Reid proved that the set of balance vertices of a tree T consists of a single vertex or two adjacent vertices. In this note, we give a simple proof of that result
[[abstract]]For a given integer , a balanced-coloring of a graph is a mapping such that for , whe...
A colouring of a strongly regular graph is an allocation of colours (or treatments) to the vertices ...
AbstractA paired-dominating set of a graph G is a dominating set of vertices whose induced subgraph ...
AbstractWe show that the set of vertices in a tree T of smallest weight balance is the (branch weigh...
AbstractA graph is bivariegated if its vertex set can be partitioned into two equal sets such that e...
Let S ⊆ V be an arbitrary subset of vertices of a graph G = (V,E). The differential ∂(S) of S equals...
Following Golubitsky, Stewart, and others, we give definitions of networks and input trees. In order...
A feedback vertex set in a graph is a subset of vertices, such that the complement of this subset in...
For a given graph G we say that a G-design is balanced if there exists a constant r such that for ea...
In Math Program 55(1992), 129–168, Conforti and Rao conjectured that every balanced bipartite graph ...
summary:A set $S$ of vertices in a graph $G$ is called a paired-dominating set if it dominates $V$ a...
AbstractIn this paper we consider the problem of determining a balanced ordering of the vertices of ...
We consider the problem of determining a balanced ordering of the vertices of a graph; that is, the ...
A paired-dominating set of a graph G is a dominating set of vertices whose induced subgraph has a pe...
Berge defined a hypergraph to be balanced if its incidence matrix is balanced. We consider this conc...
[[abstract]]For a given integer , a balanced-coloring of a graph is a mapping such that for , whe...
A colouring of a strongly regular graph is an allocation of colours (or treatments) to the vertices ...
AbstractA paired-dominating set of a graph G is a dominating set of vertices whose induced subgraph ...
AbstractWe show that the set of vertices in a tree T of smallest weight balance is the (branch weigh...
AbstractA graph is bivariegated if its vertex set can be partitioned into two equal sets such that e...
Let S ⊆ V be an arbitrary subset of vertices of a graph G = (V,E). The differential ∂(S) of S equals...
Following Golubitsky, Stewart, and others, we give definitions of networks and input trees. In order...
A feedback vertex set in a graph is a subset of vertices, such that the complement of this subset in...
For a given graph G we say that a G-design is balanced if there exists a constant r such that for ea...
In Math Program 55(1992), 129–168, Conforti and Rao conjectured that every balanced bipartite graph ...
summary:A set $S$ of vertices in a graph $G$ is called a paired-dominating set if it dominates $V$ a...
AbstractIn this paper we consider the problem of determining a balanced ordering of the vertices of ...
We consider the problem of determining a balanced ordering of the vertices of a graph; that is, the ...
A paired-dominating set of a graph G is a dominating set of vertices whose induced subgraph has a pe...
Berge defined a hypergraph to be balanced if its incidence matrix is balanced. We consider this conc...
[[abstract]]For a given integer , a balanced-coloring of a graph is a mapping such that for , whe...
A colouring of a strongly regular graph is an allocation of colours (or treatments) to the vertices ...
AbstractA paired-dominating set of a graph G is a dominating set of vertices whose induced subgraph ...
DOI
Add to ORKG