子图

n个点的单图所含子图C6的计数定理

On the enumeration theorem of subgraph c_6 contained in single graph with n points

一个具有完美匹配的图G是基本的，如果由它的容许边所导出的子图是连通的。

A graph G with a perfect matching is elementary if its allowed lines form a connected subgraph .

关于单图所含子图C3、C4、C5的计数定理

On the enumeration theorem of subgraphs c_3 , c_4 , c_5 contained inv single graph

图结构XML文档上子图查询的高效处理算法

Efficient Subgraph Query Processing Algorithms on Graph-Structured XML Documents

若图G含有生成欧拉子图，则称G是超欧拉的。

A graph G is supereulerian if G has a spanning eulerian subgraph .

图G的一个k正则支撑子图称为G的k因子。

A k-regular spanning subgraph of graph G is called a k-factor of G.

n阶无向完全图非同构生成子图的结构与作法

The Structure and Drawing of the Subpicture of Different Structures from the n-Step Directionless Full Picture

k连通图可缩边导出子图的连通性

The Connectivity of Induced Subgraph by all Contractible Edges in K - Connected Graph

图的k－degenerate子图分解

The Decomposition of a Graph into K - degenerate Subgraph

设G是有n个点的图，G的一个匹配是指G的一个生成子图，它的每个分支或是孤立点或是孤立边。

One match of G is a generating subgraph of G. Every branch is a single point or a single side .

在几类图中与任意子图（m，r）-正交的（g，f）-因子分解

( g.f ) - Factorizations ( m , r ) - Orthogonal to an Arbitrary Subgraph in Several Types of Graph

一类拟树的Euler子图

Euler Sub - Graph of A Quasi - Tree

图G不含K（4）的剖分图为子图，则称G为Series－Parallel图。

Graph G is a Series - Parallel graph , if G does not contain a subgraph which is homeomorphic to the complete 4 - graph .

将文本图像多小波分解的子图能量作为特征，用SVM实现文种分类。

The energies of sub images after multi-wavelet decomposition are used as features and SVM is used as classifier .

具有与任意图正交的（g，f）-因子分解的子图任意变量逻辑函数的卡诺图化简探索

SUBGRAPHS WITH ( g , f ) - FACTORIZATIONS ORTHOGONAL TO A SUBGRAPH IN GRAPHS ; Study of Reducing Boolean Expression with Random Variables

对检测到的候选印章子图和模板印章计算FFT变换的幅度谱图像，进而构造对应于楔环结构的幅度谱特征矩阵。

The magnitude FFT feature matrixes were constructed separately for the template seal and the candidate detected seal .

HDTV视频编码器系统子图分割并行处理单元的设计与实现

Design of Sub-Picture Division and Parallel Processing Module for HDTV MPEG-2 Video Coders

最后，采用Matlab7.0平台编程实现了基于子图分割和BP神经网络的人脸识别程序。

Finally , we use the platform of Matlab 7.0 to realize the face recognition program which based on sub-image segmentation and BP neural networks .

图G的k-正则生成子图称为G的一个k-因子，若图G的每条边都含于G的一个k-因子中，称图G足k-覆盖的。

A k-factor of graph G is a k-regular spanning subgraph of G. A graph G Is k-covered if each edge of G belongs to a k-factor .

若Γ（G）中不含有由n个顶点构成的其中任意两点连通的完全子图，我们称G有性质Pn。

We say G satisfies the property P_n , if Γ( G ) contains no a complete subgraph consisting of n vertices in which any two ones are connected .

经过对J曲线的适当策略分析，可以得到目标最大可能存在的子图区域，或者多目标可能存在的区域。

Under the analysis of some preference strategy for J plot , the most possible areas with targets are recommended .

图G的一个支撑子图F称为一个双星（DS）因子，当F的每一个连通分支是一个双星。

A ( spanning ) subgraph F of a graph G can be a DS-factor when every connected component of F is a DS .

本文借助矩阵的两类新运算给出了单图所含子图C2、C4、C5的计数公式。

In this paper , we give the enumeration formulas of subgraphs C3 , C4 , C5 contained in single graph with the help of two kinds of new operation of matrix .

针对k边连通子图的并行查询和分析技术的两个典型问题：统计三角形和最大k边连通子图查询，本文提出了基于BSP模型的解决方案。

This paper chooses two typical problems : triangle counting and maximal k-edge-connected subgraph , and proposes solutions based on BSP model .

SE（G）称为G的一个边覆盖，如果由S导出的子图是G的一个生成子图。

A subset S of E ( G ) is called an edge covering of G if the subgraph induced by S is a spanning subgraph of G.

基于G上均匀扩张树的边负相关性，我们构造G上的一族边负相关的非平凡随机扩张森林和随机连通子图。

Basing on the edge-negative association in uniform spanning tree , we construct a family of random spanning forests and random connected subgraphs on G which are edge-negative associated .

在Fullerene图中定义了三类所谓闭环链的特殊子图结构。

Three classes of special subgraph structures called closed ring chains were defined .

无爪图（claw-freegraphs）是禁用子图研究最为深入的一个图类。

The claw-free graphs is the most well researched graphs related with Forbidden Subgraphs .

进而结合mt统计量及子图提取技术，提出了一种未登录词识别方法。

Considering the characteristics , the recognition method of unknown word which combines mt and technology of subgraph extraction is proposed .

该方法把原始图像进行二维DWT分解，保留其高频细节部分，然后对小波逼近子图进行二维DCT变换并结合HVS进行水印嵌入。

Then , the approximation image is transformed by 2-D DCT and embedded with watermark by using HVS .