对偶图

  • 网络dual graph
对偶图对偶图
  1. 试论自对偶图的一些性质

    The Proof of Some Properties of The Self - Dual Graph

  2. 城市道路网容量的对偶图算法

    Dual graph algorithm for the volume of the city road network

  3. 32面体展开图的对偶图G(p,q,f)的4着色

    4-colouring of dual G ( p , q , f ) of a 32-face sphere development

  4. 基于Voronoi图及其对偶图的反最近邻查询

    Reverse nearest neighbor query based on Voronoi diagram and delaunay graph

  5. 采用标准Galerkin法形成系统的平衡控制方程时,对弱形式的积分是在Voronoi图的对偶图Delaunay三角形内进行的;

    The integration of the weak form is performed in the Delaunay triangles , which is the dual diagram of the Voronoi tessellation when the Galerkin method is used to form the discrete system equation .

  6. 自对偶图的充要条件

    The Necessary and Sufficient Condition of Self - dual Graph

  7. 平面对偶图哈密顿性的一个充分条件

    Notes on Hamiltonian Property of Dual Graphs of Plane Graphs

  8. 利用对偶图求平面图的生成树数目

    Number of spanning trees of planar graphs by the dual

  9. 四正则平面图与其对偶图的哈密顿圈

    The 4-regular plane graph and Hamilton cycle of dual graph

  10. 本文论述了自对偶图和简单自对偶图的一些性质。

    This paper discusses some properties of the Self-dual graph and simple self-dual graph .

  11. 对偶图不含三角形的有限群

    Finite Groups with Dual Graphs without Triangles

  12. 两类自对偶图

    Two Classes of Self-Dual Graphs

  13. 文中提出自对偶图的各种判定方法和某些较规则的特殊自对偶图。

    Various discrimination methods about self-duality graph are offered and some regular-shaped particular self-duality graphs are also shown .

  14. 一个图是平面图的充分必要条件是这个图存在对偶图。

    The sufficient and necessary conditions for a planar graph is that this graph must be a dual graph .

  15. 第四章主要研究有限群的对偶图的算术条件对群结构的影响。

    In Chapter 4 , we exhibit how the arithmetical conditions of the dual graph of a finite group influence its structures .

  16. 定义了有限群的对偶图,给出了对偶图不含三角形的非交换有限群的分类。

    In this paper the authors define a dual graph of a finite group and classify the finite non-abelian groups with dual graphs without triangles .

  17. 将此图作为一类超图的代表图,求得其中阶数最小及端口数最小的超图的对偶图;

    The graph is taken as a representative graph of a type of hypergraphs , and the dual hypergraph of the hypergraph of minimum orders and ports can be obtained .

  18. 给出了外平面图的拟对偶图的定义,并利用拟对偶图的性质证明了外平面图的结构定理。

    This paper presents a definition of imitative dual graph of outplane graphs , and proves the structural theorem on outplane graphs by using the nature of imitative dual graph of outplane graphs .

  19. 构造真实反映轨道交通系统出行特征的出行路径对偶图,建立能够准确反映客流在轨道交通网络内分布结果的客流分配模型和算法。

    The network topological dual diagram is used to describe the travel path in the urban rail transit system . A novel traffic assignment model and algorithm which can accurately reflect the result of passenger distribution are constructed .

  20. 进一步,Fq上2v+δ维伪辛空间的对偶极图Aδ的相应问题也被解决。

    Moreover , the corresponding problem of the dual polar graph A δ of ( 2v + δ) - dimensional pseudo-symplectic space over Fq are also solved .

  21. 输送问题的原设对偶型图上作业法

    A graphical method in primal-dual type for the transshipment problem

  22. 图G的对偶带宽是指图G中相邻两点最小标号差的最大值。

    The dual bandwidth of a graph G , denoted by ( G ), is the maximum value of the minimum labelling variance of any two adjacent vertices in G.

  23. 首先采用随机增量局部转换计算Delaunay三角剖分,然后再根据对偶特性构建Voronoi图。

    Delaunay triangulation is achieved by using randomized incremental local transformation . Then its Voronoi diagram is created according to the dual property .

  24. 当图G表示一种冲突关系时,便提出如下的对偶问题:将图G嵌入于主图H,使得边的最小跨度达到最大。

    In case of graph G representing a conflict relation , the following dual problem is proposed : to embed G into a host graph H such that the minimum stretch of the edges of G is maximized .

  25. 基于对偶点和扩展图结构的化工厂管网建模研究

    The research on the approach to piping network modeling of chemical plants based on the duality point and the enhanced graph

  26. 本文采用统一的方法分析直流直流变换器中的对偶电路,将电路的对偶分解为拓扑图的对偶和元件的对偶。

    The unified approach is applied to analyze dual circuits in DC DC converters , i. e. , the duality of circuits is decomposed into the duality of topological graphs and the duality of elements .