1) mixed graph
混合图
1.
In this paper,we prove four Laplacian eigenvector principles of mixed graph that is edge principle, reduction and extension principle,alternating principle,and contraction principle.
给出了混合图的Laplacian特征向量的四个原则:边原则、减少和延伸原则、配对原则、收缩原则,研究了通过加边、合并点等对混合图的Laplacian特征值和特征向量的影响。
2.
This paper mainly discusses a class of mixed graphs with following property:all nonsingular cycles share exactly one common edge and any two nonsingular cycles have no other common vertices except that of the common edge.
主要讨论具有如下性质的一类连通混合图G:其所有非奇异圈恰有一条公共边,且除了该公共边的端点外,任意两个非奇异圈没有其它交点。
2) mixed graphs
混合图
1.
On eigenvalues of a class of mixed graphs with same underlying graphs;
具有相同基础图的一类混合图的特征值
2.
On structure of eigenvectors of mixed graphs;
关于混合图的特征向量的结构(英文)
3.
We characterize the mixed graphs with exactly one Laplacian eigenvalue moving up by an integer and other Laplacian eigenvalues remaining invariant when a loop is added.
本文刻画了如下的混合图:在添加一个环时,它恰有一个 Laplace特征值以整数增加,其它的 Laplace特征值保持不变。
3) hybrid graph
混合图
1.
Disassembly hybrid graph model based on modular design;
基于模块化设计的混合图拆卸建模研究
2.
Based on characteristics of selective disassembly,selective disassembly model based on hybrid graph was introduced.
根据选择性拆卸的特点,介绍了基于混合图的选择性拆卸模型。
3.
Product disassembly hybrid graph model which describes the mating contact and non-contact priority relationships among constituting components,is established based on the characteristic of disassembly.
根据拆卸的特点构建适合计算和优化的产品拆卸混合图模型,该模型描述了零部件之间的连接关系和优先关系。
4) mixed image element
混合图元
1.
Research of mixed image element encryption algorithm based on chaotic system;
基于混沌的混合图元加密算法研究
2.
In accordance with the definitions of block image element and mixed image element with ECC,a block image element encryption algorithm based on ECC is proposed in this paper.
在引用块图元、混合图元等概念的基础上,应用椭圆曲线密码体制,提出了一种基于ECC的块图元加密算法。
5) mixed hypergraph
混合超图
1.
A mixed hypergraph consists of a finite set and two families of subsets: D-edges and C-edges.
混合超图是含有两种超边的超图,一种称为D-超边,一种称为C-超边,它们的区别主要体现在染色要求上。
2.
The notion of mixed hypergraph was introduced by Vitaly Voloshin, it is a generalization of the notion of hypergraphs.
混合超图是含有两种超边的超图,一种称为D-超边,一种称为C-超边,它们的区别主要体现在着色要求上。
6) mixed Cayley graphs
混合Cayley图
补充资料：图的减缩图(或称图子式)
图的减缩图(或称图子式)
minor of a graph
图的减缩图(或称图子式)【.皿以ofa脚户;MHHoPrpa中a」【补注】设G是一个图(graph)(可以有环及多重边).G的一个减缩图(nullor)是从G中接连进行下述运算而得的任何一个图: i)删去一条边; 五)收缩一条边; 说)去掉一个孤立顶点. NRobe由on与P.D.Se脚aour的图减缩定理(脚Ph nl的。r theon习11)如下所述:已知有限图的无穷序列G，，GZ，…，则存在指标i
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条