1) adjacency graph
邻接图
1.
Object-oriented adjacency graph partition algorithm for remote sensing image segmentation
基于邻接图的面向对象遥感图像分割算法
2) Adjacent tree graph
邻接树图
1.
おァ et G be a connected graph and H be the adjacent tree graph of G.
设Ｇ是任一连通图，Ｈ是Ｇ的邻接树图，κ（Ｈ），λ（Ｈ），δ（Ｈ）分别是Ｈ的连通度，边连通度和最小次，则κ（Ｈ）＝λ（Ｈ）＝δ（Ｈ）。
3) block adjacency graph(BAG)
块邻接图
1.
After analyzing the advantages and disadvantages of the existed grid-line erasing algorithm we present a grid-line erasing algorithm based on the block adjacency graph(BAG) devised by Pavlidis and the stroke reconstruction algorithm in this paper.
在分析已有的手写汉字文本格线删除算法利弊的基础上,采用Pavlid is提出的块邻接图表示法来进行格线删除,并提出了格线删除后的笔画重构算法。
4) adjacency tree graph
邻接树图
1.
1, the adjacency tree graph T(G) of simple connected graph G is a complete graph if and only if base number of cycle ρ(G)=1 and the length of the cycle is three.
文献1给出了简单连通图G的邻接树图T(G)是完全图的充分必要条件是:G的圈基数ρ(G)=1且此回路的长度为3。
5) adjoining chart
邻接海图
6) adjacent sheet
邻接图幅
补充资料：邻接
1.邻近，接近。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条