搜索结果: 1-3 共查到“数学分析 Graphs”相关记录3条 . 查询时间(0.046 秒)
The absence of efficient dual pairs of spanning trees in planar graphs
planar graphs cells
2015/8/26
A spanning tree T in a finite planar connected graph G determines a dual spanning tree T* in the dual graph G* such that T and T* do not intersect. We show that it is not always possible to find T in ...
We give a non-deterministic algorithm that expresses elements of SLN(Z), for N>2, as words in a finite set of generators, with the length of these words at most a constant times the word metric. We sh...
INTERVALS OF SABIDUSSI GRAPHS
Sabidussi graph Interval Strong interval Decomposition tree
2008/11/25
A Sabidussi graph is defined from a total order T and a graph G as follows. Choose
a vertex of G and denote it by 0. Denote by V(T)V(G) the family of the functions
f :V(T)¡!V(G) such that fq 2...