第三章主要给出计算单圈图的零度的公式。
Then by means of maximum matching number we give aformula to calculate the nullity of unicyclic graphs.
若G是哈密顿图，则其线图L（G）是泛圈图。
If G is Hamiltonian, then its line graph L(G) is pancyclic graph.
第一个色圈图正是由爱萨克·牛顿爵士于1666年设计的。
The first circular color diagram was designed by Sir Isaac Newton in 1666.
从边集合出发给出了计算有向基因组的圈图连通分支的线性时间算法。
An algorithm for computing the connected components of the cycle graph of the given two signed genomes is studied, which is more efficient than the primary algorithm.
主要讨论了单圈图按其最大特征值进行排序的问题，确定了该序的前六个图。
The order of unicyclic graphs according to their largest eigenvalues is studied in this paper, and the first six unicyclic graphs in this order are determined.
第三部分主要研究双圈图的谱矩的基本性质和谱矩序列排列的一些规律性结论。
Section Three provides the mainly results on the spectral moment of bicycle graphs and its lexicographical order.
研究了单圈图、双圈图的反比度，给出了它们的上下界并得到达到最大最小值的极图，还进一步给出多圈图的上下界的一个猜想。
In this paper, inverse degree of unicyclic graphs and bicyclic graphs is discussed, and the extremal graphs that reach the upper and lower bounds are given.
大照片的底端圈出了赫西俄德和皮塔·图斯的位置。
For location, Hesiodus and Pitatus are circled at the bottom of the picture.
图1显示了一个名叫“FriendBridge”的社交网络应用程序，它提供扩展用户社交圈的服务。
Figure 1 shows a social network application called "Friend Bridge," which provides the service to extend a user's social network.
例如，单击ServerConfiguration(图16中红圈中的报告)就可以看到服务器的当前配置。
For example, clicking on the server configuration, as shown in the red circle in Figure 16 above, takes you to the current configuration of the server.
恶名远扬生物圈二号封闭生态系统项目就是未经充分准备仓促上马的前车之鉴。 1991年，首批八个人住进位于亚利桑那州图克森附近的生物圈二号。
The infamous Biosphere 2 closed-ecosystem project outside Tucson, Ariz., first inhabited by eight people in 1991, is the best example of an approach not to take.
图15显示ServerProfileManager视图并在这两个图标上加上了圈。
Figure 15 shows the Server Profile Manager view with a circle drawn around these two ICONS.
仔细观察每张图，读出句子。将正确的单词圈出后讲述该故事。
Look at each picture and read the sentence. Circle the right word for each sentence. Tell the story.
图11显示了数以千记的不同的金属密封圈的唯一体现。
FIG. 11 illustrates just one embodiment of thousands of different metal seals.
符号图s是平衡图，如果它的每一个圈都包含偶数条负边。
Asigned graph s is balanced if each of its cycles contains even negative edges.
一广义圈是一无向图，其顶点次数都是非零偶数。
A circ is an undirected graph having only vertices of even nonzero degree.
第三部分研究了一种特殊图——置换图的完整度，给出了圈及路置换图的完整度及相关的一些结果。
The third chapter focuses on the integrity of a special kind of graphs-permutation graphs, especially the cycle permutation graphs.
我们还讨论了在GLC的亮度监测范围内树图及一圈修正后的总截面随质心能量的变化关系。
We discussed the relations between the cross-sections in tree level (and one-loop corrected cross sections) and center-mass energy in the luminosity measuring ranges of GLC.
对于非奇异单圈混合图，范益政给出了其最小特征值所对应特征向量的一个很好结构性质。
In the case of being a unicyclic mixed graph, Fan Yi-Zheng gives a remarkable result on the structure of the eigenvectors corresponding to its smallest eigenvalue.
本文综述关于原始图与三次图的可圈度的近期结果并提出一些未解决的问题。
Recent results on primitive graphs and on the cyclability of cubic graphs are reviewed and several open problems are proposed.
时间结构的表达则从时间结构的形态方面总结出等时线、等时圈、时间廓线图和网络图等表达形式；
Thirdly, summarize four expressing forms of urban time structure of which isotime curve, isotime circle, time contour and time network.
在安装排气阀f V -4 M 1后，将小排气帽松开旋转两圈(参阅图4)。
After installing the FV-4M1, back off the small vent cap two turns (see Fig. 4).
研究一类特殊的本原双色有向图，其未着色的有向图包含两个圈。
Special primitive two-colored digraphs whose uncolored digraph consist of two cycles are considered.
在第一章中我们研究了平面1 -圈共振图的构造和识别。
In the first chapter, we discuss the construction and the recognition of planar 1-cycle resonant graphs.
本文给出了测地图包含八圈时，八圈和它上的割线构成图的结构形式。
The construction of the graphs formed by eight-circuit and its secants is obtained.
通过有向图的邻接矩阵的轨道来刻划图的哈密顿圈问题。
According to the orbit of adjoining matrix of directed graph the problem of Hamiltonian cycle is described.
计算机科学数据库的关系中遇到了可归为倍图或补倍图的参数和哈密顿圈的问题。
In the relation of the database theory of the computer, we encounter some problems which can be translated into the problem for parameter and Hamilton cycle of double graphs or complement graphs.
本文考虑了图的中间图的邻点可区别全色数，并确定了路、圈、星图和扇图的中间图的邻点可区别全色数。
The adjacent vertex distinguishing total chromatic number is obtained for the middle graphs of path, cycle, star and fan graph.
本文考虑了图的中间图的邻点可区别全色数，并确定了路、圈、星图和扇图的中间图的邻点可区别全色数。
The adjacent vertex distinguishing total chromatic number is obtained for the middle graphs of path, cycle, star and fan graph.
应用推荐