In this paper, some properties of removable edge in 4-connected graphs are obtained.
给出了4连通图中可去边的一些性质。
The topological sorting algorithm works on unconnected graphs as well as connected graphs.
拓扑排序算法既可以用于连通图，也可以用于非连通图。
This paper presents a survey on the properties and distributions of contractible edges and removable edges in 3 connected graphs.
综述了3连通图中可缩边和可去边的性质以及它们在图中的分布情形。
In this paper, we use the reconstructibility of weighted nuclear subgraphs and it is proved that connected graphs are reconstructible.
本文我们利用带权核子图的可重构性证明了连通图是可重构的，从而证明了重构猜想为真。
Moreover, the distribution of removable edges in the edge-vertex cut atom and its separating pair for 4-connected graphs was obtained.
同时给出4连通图4圈上和边点割原子及分离对上的可去边的分布。
The advantages of the method are: unified algorithms, simplicity, easy modification and parallelism, and it can be used to draw non connected graphs directly.
其优点在于，算法统一、方法简单、容易实现、便于修改，并且易于并行化，可以直接用来画非连通图。
Contractible edges and removable edges in connected graphs are a powerful tool to study the structures of connected graphs and to prove some properties of connected graphs by induction.
图的可收缩边与可去边是研究连通图的构造和使用归纳法证明连通图的一些性质的有力工具。
The essay has a study on enumeration question labeled oriented connected graphs with only one cut vertices and labeled oriented connected graphs that all of cut vertices are in same block.
根据标号有向块的指数型生成函数，研究了具有唯一一个割点的标号有向连通图及所有割点都在一个块上的标号有向连通图的计数问题。
One of several useful features of DB2 Intelligent Miner is that it finds strongly connected sub-graphs within this network.
DB 2Intelligent Miner的有用功能之一是能够在这个网络中寻找强连接的子图。
The connected augmentation of weighted graphs is NP hard problem that has been proved.
加权图的连通扩充问题已被证明是NP完全问题。
Minimizing retransmission nodes in broadcasting is equivalent to minimizing connected dominating set in graph theory, and finding a minimum connected dominating set is NP-complete for graphs.
广播过程中最小化参与转发节点数问题与图论中求解最小连通支配集问题等价，而在任意图中求解最小连通支配集是NP完全问题。
This paper argues first that atomic parts of a connected circular graph are still connected circular graphs. It also gives some natures about connectivity of connected circular graphs.
本文首先得到了循环图的原子部分仍为连通循环图的结果，同时还得到了连通循环图的连通度的一些性质。
In the last chapter, we discuss the longest cycle of 2-connected quasi claw-free graphs.
第六章中我们讨论了2 -连通半无爪图的最长圈。
In this paper, the existence of large cycles in 2-connected triangle-free graphs is discussed.
研究了2连通无三角形图中长圈的存在性。
Statistics of two graphs the number of connected components.
统计两个图的连通分量的个数。
Because a lot of third-party developers use a unified database of location information and user profiles, the LBS information is more effective because it is connected to social graphs.
由于许多第三方开发商参考的是同样的位置信息和用户资料数据库，所以定位服务因与社交图谱相联系而效果更为显著。
In second chapter, we discuss the trace-ability of 2-connected (K_(1,4); 2)-graphs;
在第二章中，我们讨论了2-连通（K_（1，4）；2）-图的可迹性；
In second chapter, we discuss the trace-ability of 2-connected (K_(1,4); 2)-graphs;
在第二章中，我们讨论了2-连通（K_（1，4）；2）-图的可迹性；
应用推荐