In this paper, we introduce a concise representation, called right-distance sequences (or RD-sequences for short), to describe all t-ary trees with n internal nodes. A result reveals that thereâ€¦ (More)

Let V (G) be the vertex set of a graph G = (V; E) and G ?u be the subgraph induced by the vertex set V (G) ? fug. A vertex u 2 V (G) is said to be a hinge-vertex of G if and only if there exist twoâ€¦ (More)

A queue layout of a graph consists of a linear order of its vertices, and a partition of its edges into queues, such that no two edges in the same queue are nested. In this paper, we show that theâ€¦ (More)

The all-pairs-shortest-length (APSL) problem of a graph is to nd the lengths of the shortest paths between all pairs of vertices. In this paper, we study the APSL problem on chordal bipartite graphs.â€¦ (More)

A king x in a tournament T is a player who beats any other player y directly (i.e., x â†’ y) or indirectly through a third player z (i.e., x â†’ z and z â†’ y). For x, y âˆˆ V (T ), let b(x, y) denote theâ€¦ (More)