Currently displaying 1 – 3 of 3

Showing per page

Order by Relevance | Title | Year of publication

The Path-Distance-Width of Hypercubes

Yota Otachi — 2013

Discussiones Mathematicae Graph Theory

The path-distance-width of a connected graph G is the minimum integer w satisfying that there is a nonempty subset of S ⊆ V (G) such that the number of the vertices with distance i from S is at most w for any nonnegative integer i. In this note, we determine the path-distance-width of hypercubes.

Spanning tree congestion of rook's graphs

Kyohei KozawaYota Otachi — 2011

Discussiones Mathematicae Graph Theory

Let G be a connected graph and T be a spanning tree of G. For e ∈ E(T), the congestion of e is the number of edges in G joining the two components of T - e. The congestion of T is the maximum congestion over all edges in T. The spanning tree congestion of G is the minimum congestion over all its spanning trees. In this paper, we determine the spanning tree congestion of the rook's graph Kₘ ☐ Kₙ for any m and n.

Completely Independent Spanning Trees in (Partial) k-Trees

Masayoshi MatsushitaYota OtachiToru Araki — 2015

Discussiones Mathematicae Graph Theory

Two spanning trees T1 and T2 of a graph G are completely independent if, for any two vertices u and v, the paths from u to v in T1 and T2 are internally disjoint. For a graph G, we denote the maximum number of pairwise completely independent spanning trees by cist(G). In this paper, we consider cist(G) when G is a partial k-tree. First we show that [k/2] ≤ cist(G) ≤ k − 1 for any k-tree G. Then we show that for any p ∈ {[k/2], . . . , k − 1}, there exist infinitely many k-trees G such that cist(G)...

Page 1

Download Results (CSV)