导出图

词组短语

adjoint graph · derived graph

与导出图相关的网络例句 [注：此内容来源于网络，仅供参考]

After analyzing the characters of current hydraulic CAD, the method was put forward to use concurrent computer supported cooperative work to regulate hydraulic CAD, and to realize assistant graphics element drawing, principle drawing formation, data exchange, network communication and background data - base service by employing object - oriented technology, dialog box and control widget technology, input - output of graphics ＆ image and socket technology.

在分析当前液压CAD的特点之后，提出了用并行协同设计模式规划液压CAD，运用面向对象（object-oriented）技术、对话框和控件技术、数据库图库存储提取技术、导入导出图形图像技术和socket技术，具体实现了辅助图元绘制、原理图生成、数据交换、网络通讯和后台数据库服务各个功能，使液压系统计算机辅助设计得到进一步的完善。

Then we prove the one-to-one corresponding relation between 3-coloring of inducing four regular graph and 4-coloring of maximal planar graph and find out the relation between three colors of inducing four regular graph and three dual bi-chromatic subgraph of maximal planar graph.

本文给出了极大平面图的导出四正则图的两种构造方式、等价性及性质，证明了导出四正则图的三着色与原极大平面图四着色的一一对应关系，并且找出了导出四正则图的三种颜色与原极大平面图四着色的三组对偶二色子图之间的关系。

Let G = V(G,E be a simple graph with |V| vertices and |E| edges. Let |V|= p,|E|= q, if there exists f: V →{1,2,...,p} be an injective mapping, and define an inducedfunction f":E→{1,2,...,q} by setting f"=|f-f| for all∈E. If f maps E onto {1,2,...,q}, then f is said to be a Skolem-graceful labeling of G, the graph G is said to be a Skolem-graceful graph.

对一个给定的简单图G=V(G，E，|V|和|E|分别是图G的顶点数和边数，令|V|=p，|E|=q，如果存在一个一一映射f：V→{1，2，…，p}，使得对所有边∈E，由f′=|f-f|所导出的映射函数f′：E→{1，2，…，q}是一一对应关系，则称f是图G的一个Skolem优美标号，图G被称为Skolem优美图。

A graph G is claw-free [27] , if it does not contain K〓 as an induced subgraph.

如果图G不含K〓为导出子图，则称G是无爪图[27]。

The tree T=is a bichromatic tree subgraph in a maximal plannar graph G, in which the subgraph induced by V_t is a tree and T is a component of some bichromatic subgraph Gij of some 4-coloring of G.

极大平面图G=中的一个二色树子图T=，其Vt在G中导出子图为树，并且图G存在至少一个四着色C，使T是该四着色一个二色子图的一个连通支。

If G is a {2K_1+K_2, C_4}-free graph, we show thatifα＞3 then G is a split graph, and ifα=3 then for any independentset S of cardinality 3, G-S is a chordal graph or G-S?

如果图G不含与4-圈和2K_1+K_2同构的导出子图，我们证明了如果α＞3，那么G是一个split图；如果α=3，那么对于G的任一个有三个元素的独立集S，G-S是一个弦图或者G-S？

Degree sum conditions of IM-extendable graphs are researched. The main results are as follows:(1) Let G be a graph with 2n vertices. If for each pair of nonadjacent vertices u and v in G,, then G is IM-extendable.(2) Let G be a claw-free graph with 2n vertices. If for each pair of nonadjacent vertices u and v in G,d+d≥2n+3, then G is IM-extendable.

研究导出匹配可扩图的度和条件，主要结果如下：(1)若图G有2n个顶点，且对于G中每一对不相邻的顶点u和v，，则G是导出匹配可扩的；(2)若G是一个有2n个顶点的无爪图，且对于G中每一对不相邻的顶点u和v，d+d≥2n+3，则G是导出匹配可扩的。

Degree sum conditions of IM-extendable graphs are researched. The main results are as follows 1 Let G be a graph with 2n vertices. If for each pair of nonadjacent vertices u and v in G,, then G is IM-extendable. 2 Let G be a claw-free graph with 2n vertices. If for each pair of nonadjacent vertices u and v in G,du+dv≥2n+3, then G is IM-extendable.

研究导出匹配可扩图的度和条件，主要结果如下 1若图G有2n个顶点，且对于G中每一对不相邻的顶点u和v，，则G是导出匹配可扩的 2若G是一个有2n个顶点的无爪图，且对于G中每一对不相邻的顶点u和v，du+dv≥2n+3，则G是导出匹配可扩的。

Furthermore, it can be deduced from Fig.

此外，可以推导出图。

An electromagnetic power steering kinematics model is built combined with the sensor and power equipment"s kinematics characteristic, then according to bond graph theory the bond graph model and diamond model of the electromagnetic power steering system are built based on the kinematics model. They could lead to the system"s transfer function, which is combined with automobile"s two freedom degree model, finally leads to the system"s model in condition with step input of steering wheel.

结合转矩传感器和电磁力发生装置的动力学特性建立了电磁式助力转向系统的动力学模型，然后在系统的动力学模型的基础上根据键合图理论建立了电磁式助力转向系统的键合图模型及其方块图模型，从而导出系统的传递函数，再结合二自由度汽车模型，最终建立了系统在方向盘转角阶跃输入下的模型。

与导出图相关的网络解释 [注：此内容来源于网络，仅供参考]

adjoint functor：伴随函子

adjoint function 伴随函数 | adjoint functor 伴随函子 | adjoint graph 导出图

adjoint graph：导出图

adjoint functor 伴随函子 | adjoint graph 导出图 | adjoint group 伴随群

adjoint group：伴随群

adjoint graph 导出图 | adjoint group 伴随群 | adjoint hilbert problem 伴随希耳伯特问题

Cartesian product of graphs：图的笛卡尔积

多组分相图:multi-componet phase graphs | 图的笛卡尔积:Cartesian product of graphs | 导出匹配可扩图:IM-extendable graphs

Depth map：深度贴图 深度贴图

deployment 展开 布署 | Depth Map 深度贴图 深度贴图 | derive 导出 导出

derived graph：导出图

derived functor 导函子 | derived graph 导出图 | derived rule of inference 推理的导出规则

derived rule of inference：推理的导出规则

derived graph 导出图 | derived rule of inference 推理的导出规则 | derived series 导出列

derived：导出

一个没有输入参数的查询模拟一个导出(derived)属性,例如age是病人对象类的一个导出属性. 图6 是不同抽象的整合总结. 一个动态的转变(transition)是事件触发的一组基本操作和由这些操作操控的一组持久(persistent)对象.

induced subgraph：导出子图

"感应光导体损耗","induced optical conductor loss" | "导出子图","induced subgraph" | "导出单轴各向导性","induced uniaxial anisotropy"

induced subgraph：导出子图,诱导子图

induced stress | 诱导应力 | induced subgraph | 导出子图,诱导子图 | induced surface layer | 感应表面层