查询词典 interval graph

The line graph of further complete bipartite graph(infinite graph of n≥6) is extendable graph.

进一步完全二部图(n≥10的无限图)的线图是可扩圈图。

One of graph edge coloring and graph total coloring problem, as well as whole graph chromatic number problem can be converted to graph vertex coloring to deal with problem.

其中图的边着色和图的全着色问题以及图的色数问题都可以转化为图的顶点着色问题进行处理。

Let be the maximum degree of a vertex in graph . Chen et al. conjectured that a connected graph is equitable -colorable if is not a complete graph , or an odd cycle , or a complete bipartite graph for all .

令 表图上的点的最大度数，陈伯亮等人，提出以下这个猜测：如果一个连通图不是，这三类的话，则可以用个颜色来均匀著色。

Graph theory and topology was researched to establish graphic interpreter, boolean multiplication ⊙ of a matrix is inferred and defined, and simple sub-graphs are disconnected from complex graph by the multiplication ⊙; parameterization of graph is realized through a sequence of sub-graph entities linked by constraints.

研究了图形翻译器的图论和拓扑学理论基础，推出并定义了矩阵布尔乘运算〓，使用矩阵运算〓将复杂的图形拆分成一系列简单子图；以约束关联的子图实体序列实现图形的参数化。

This paper presents and discusses some generating principles and methods of the test graph on the system level fault diagnosis about random test graph,limit t fault diagnosable test graph, t fault diagnosable test graph and so on.

提出并研究了系统级故障诊断测试图中任意测试图、受限t可诊断系统测试图和t可诊断系统测试图的生成原理及方法，还给出了一个典型测试图的生成实例。

If the vertex set of a graph can be partitioned into two disjoint nonempty sets V_(1) and V_(2), every vertex in V_(1) connects every vertex in V_(2) and there is no edge in V_(1) and V_(2), then we call this graph is a complete bipartite graph. If V_(1) contains m elements and V_(2) contains n elements, then we denote this complete bipartite graph K_.

当一个图中的点集合可以分成两个非空的集合V_(1)及V_(2)，若 V_(1)中的每一点都与V_(2)中的点有边相连，且在V_(1)及V_(2)中的点都没有边相连，则称此图为完全二分图；若 V_(1)中有m个点，V_(2)中有n个点，则此完全二分图记为K_。

Based on the dual relation between flow graph and potential graph,flow graph represent the trusses and potential graph represent the mechanisms,obtained the duality relation between trusses and mechanisms.

基于流图和势图的对偶关系以及基尔霍夫定律，用流图表示桁架，势图表示机构，建立了桁架和机构的对偶关系。

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.

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

The Innovation Graph Technique is very good at real-time, so this paper goes deep into the research that the identification of topology change, bad data utilizing Innovation Graph Technique and its practicality in order to expand the theory of Innovation Graph Technique and supply a approach which can identify bad data and topology change in real lager-scale power network quickly and effectively.The model of the Innovation Graph is further studied in this paper.

新息图状态估计具有良好的实时性，本文对其在拓扑变化辨识、不良数据辨识及实用化方面进行了深入研究，旨在拓展新息图理论，提供快速有效的、可实用化的拓扑变化和不良数据辨识方法。

The graph combinations used in advertisement were generalized and elaborated,including variant graph combination,substituting graph combination,and isomorphic graph combination.

广告设计的主要任务在于有效地传递商品和服务信息，树立良好的品牌和企业形象，刺激消费者的购买欲望，并从精神上获得美的享受，最后达到促进销售的目的。

When this condition occurs, inbound replication with the source partner is stopped on the destination domain controller and event ID 2042 is logged in the Directory Services event log.

计算机密码学是研究计算机信息加密、解密及其变换的科学，是数学和计算机的交义学科，也是一门新兴的学科。

Instructions: click on the thumbnails to see a larger image, then use the left-right arrow keys to scroll through the slideshow.

使用说明：滑鼠点在小图上即可放大观赏。开启后键盘左右键可用来换照片。