查询词典 underlying graph

The dissertation details the functions and characteristic of curves graph element, polygon graph element, character graph element, dimension graph element, parameter graph element, self-define graph element, and research comprehensively the methods describe and graph element attrib. After discussing the basic graph element collection, this thesis gives the description method, organization way, graph element visitation, save and load efficiency, suitability and so on of every element in the basic graph element collection in greater detail. The author provides a graph element data structure organized version which is length changeable and is a block storage record, and designs a new module of data, which can process both the geometry attrib and no geometry attrib of drawing element. Based on this, the data model of all kind of element is put forward.

对采矿CAD系统中基本图元集的构造原则和组织方法进行了研究，提出了一个7元素采矿CAD基本图元集构造方案；论文详细讨论了曲线图元、字符图元、尺寸标注图元、多边形图元、参数图元、自定义图元在采矿CAD系统中的作用和特点，并对各种图元的表述方法和图元属性及相应的库组织方式、存取效率进行了深入的研究，提出了一个&可变长记录块&图元库结构组织方案；通过对采矿CAD系统中基本图元数据模型的构造方法、存取结构和访问方式的研究，给出了一个用C++语言描述的采矿CAD系统基本图元数据模型及其数据存取结构。

In this paper, firstly, not only the incidence matrix ,adjacent matrix, cycle matrix, cut-set matrix of an undirected graph are summarized, but also the close contact between a graph and its corresponding matrix are discussed ; secondly, many problems of a graph which are solved by analysing its matrix are listed as follows:1、The co-tree set of a graph is obtained by using its cycle-matrix ; 2、The branches of its spanning tree are given by using its cut-set matrix ; 3、By making use of the incidence matrix of a graph ,not only its vertex cut 、cut vertex 、isolated point and spanning tree can be obtained ,but also the two sides which are whether parallel or not can be judged ;4、By using their adjacent matrix ,the two graphes which are whether isomorphous or not can be judged; once more, there is a detailed introduction in view of special graph (for example: bigaritite graph ,regular graph and so on);last but not least, a graph method of calculating the N power of a matrix is given and the practical applications of the theorem for degree is indicated.

本文首先综述了无向图的关联矩阵，邻接矩阵，圈矩阵，割集矩阵以及图和它对应矩阵之间的关系；其次总结出了利用上述各类矩阵可以解决的图的若干问题：1、利用图的圈矩阵可以求其连枝集；2、利用图的割集矩阵可以求其生成树的树枝；3、利用图的关联矩阵不仅可以求其割点、点割集、连通度、孤立点和生成树，而且可以判断两条边是否平行；4、利用图的邻接矩阵可以判断两个图是否同构；再次，针对特殊图（例如：二分图、正则图等等）的邻接矩阵作了详细介绍；最后，得到了利用图计算矩阵的N次幂的方法，指出度数定理的实际应用。

In the special case when G = AutX, we call a G—vertex-transtive graph, G—edge-transtive graph, G—semisymmetric graph X is vertex-transtive edge-transtive semisymmetric graph respectively In this paper we investigate the autmorphism graph AutX of the cubic semisymmetric graph of order 12p ,when p is primes.

特别地，若G=AutX这时的G-点传递图、G-边传递图、G-半对称图称为点传递图边传递图半对称图。

Applying the De Caen"s inequality of sum of the squares of the degree and Cauchy"s inequality, we obtain a strict lower bound and a strict upper bound of the largest Laplace eigenvalues only in terms of vertex number of a unicycle graph. Applying the Laplace matrix theorem of trees, we obtain an upper bound of the second smallest Laplace eigenvalues of a unicycle. Extremal graph whose second smallest Laplace eigenvalues reach the obtained upper bound is determined. We also obtain an upper bound of the second largest Laplace eigenvalues in terms of vertex number of the largest connected branch of unicycle graph, and obtain a theoretical method to calculate the second largest Laplace eigenvalues of unicycle graph. We obtain an upper bound of any Laplace eigenvalues in terms of vertex number of a unicycle graph. We also obtain the distribution of Laplace eigenvalues in the inter [0,n] in terms of the matching number.

本文得到了以下几个方面的结果： 1、利用图度平方和的De Caen不等式和Cauchy不等式给出单圈图的最大Laplace特征值仅依赖于顶点数的严格的上下界；利用树的Laplace理论给出了单圈图次小Laplace特征值的一个上界，并刻画了达到该上界的极图；利用子图的连通分支的顶点个数给出了单圈图次大Laplace特征值的一个上界，并给出了单圈图次大Laplace特征值一个理论上的一个求法；利用单圈图的阶数给出了其一般Laplace特征值的一个上界；利用单圈图的匹配数给出其Laplace矩阵谱在区间[0，n]上的分布情况。

Graph theory s 02 graph theory widely used for its own development. 40-60 20th century era matroid theory and graph theory-very graph theory, algebra and graph theory. topology theory has great development.

详细说明：图论讲义02 图论的广泛应用，促进了它自身的发展。20世纪40-60年代，拟阵理论、超图理论、极图理论，以及代数图论、拓扑图论等都有很大的发展。

Moreover, the range of m is obtained when G is a forest, a unicyclic graph, a bicyclic graph, a tricyclic graph and a tetracyclic graph, respectively, and the graph is determined when m(≥1) takes different value in its range.

给出了当G是森林、单圈图、双圈图、三圈图、四圈图时m的取值范围，并确定了m(≥1)在该取值范围内取不同值时的所有图。

Basing on the results of examining the impact on price, liquidity and volatility of underlying stocks after warrant issuance, the paper concludes that:(1) the issuances of warrant has the temporary positive effects on the underlying stocks" price and the positive effects happen on the introduction day but not on the listing day.(2) The issuance of the warrants causes the underlying stocks" trading volume and amount increases and heighten their liquidity.(3) The issuance of the warrants has no impact on the system risk-β, but decreases the total risk and volatility of underlying stocks.

本文最后通过综合认购权证和认股权证发行前后标的股票价格，流动性和波动性的变化结果后，认为：(1)认股权证的发行对标的股票的价格有短暂地正的价格效应，而这种对标的股票正的价格效应发生在认股权证公告日而非上市日；(2)认股权证的发行促使标的股票的交易量和交易额的增加，提高了标的股票的流动性；(3)认股权证的发行对标的股票的系统风险即β值没有影响，但能降低标的股票的整体风险，减小标的股票的波动性。

Chapter Two illustrates the nature of the international guarantee.At first,the writer analyses the meaning of collateral nature and its theoretical basis.Thewriter points out that in order to reinforce the protection of the guarantor'sinterest,the guarantee is located as collateral guarantee in all countries'traditional legislation.In other words,the validity of the guarantee contract isdetermined by the underlying contract,i.e.if the underlying contract isestablished,the guarantee contract is established,too;if the underlying contract isvalid,and the guarantee contract is valid too.It is true,otherwise.But thedoctrine of autonomy of private law dominates the civil law and commercial lawin all the countries,so the parties are permitted to alter the collateral nature of theguarantee by an agreement under the related laws worldwide.so the collateralnature of the guarantee is not the compulsory nature of the law.This lays a solidfoundation for the emerging of the independent guarantee.The writer thenanalyses the meaning of independence and the cause of the booming of theindependent guarantee.In fact,the independent guarantee was originated fromthe change of the collateral nature by the parties contract.As a result,the validityof the contract of independent guarantee is not determined by the underlyingcontract as the collateral guarantee,But the validity of the independent guaranteecontract is independent from the underlying contract,the establishment and thevalidity of the contract of independent guarantee are not subjected to theunderlying contract.

第二章对国际信用担保的法律属性进行了论述，首先分析了从属性的含义及其理论基础，指出虽然各国传统立法为了加强对保证人利益的保护，都将信用担保定位于从属保证，即保证合同的效力取决于主合同的效力，主合同成立，保证合同也成立，主合同生效，保证合同也生效；主合同不成立，保证合同也不成立，主合同不生效，保证合同也不生效，但是由于私法自治的精神主导着各国的民商法领域，各国立法都允许当事人通过合同约定对信用担保的从属性进行改变，所以保证的从属性从来就不是信用担保制度的法律强制属性，这也为独立保证制度的出现奠定了制度前提；其次分析了独立性的含义以及独立保证兴起的原因，独立保证实际上就是当事人通过合同约定对保证从属性的改变，使独立保证合同的效力不再象从属保证合同的效力那样取决于主合同的效力，而是使独立保证合同的效力独立于主合同的效力，独立保证合同成立不因主合同的不成立而受影响，也不因主合同的无效而无效。

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.

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

"The operators will suffer a temporary decrease in the number of consumers and short message services as people may not like having to provide their ID cards for a phone number," Xu Junqi, vice-dean with the Policy-Making Institute of the Telecommunications Research Centre under MII, said yesterday.

信息产业部下属的通信决策研究院副主任徐俊其昨天说：&实行手机实名制后，人们可能不太情愿用身份证注册手机号，所以通信运营商会暂时面临用户减少和短信用户减少的问题。&

I don't believe in make-believe!

我不相信这些虚构的故事。