I hope the graphs on the following pages are self-explanatory. 我希望后面几页的图表能一目了然。
He is drawing two graphs. 他正在画两张曲线图。
The graphs in Figure 3 illustrate our performance results from running on various nodes. 图3中的关系图说明了我们在各个节点上运行的性能结果。
We analyzed the performance and capacity results further by looking at the graphs included in this article. 通过查看本文提供的图形,我们进一步分析了性能和容量结果。
Are you using lots of charts and graphs? 是否要使用大量的图表和图形?
You can also scale line graphs with a similar approach to that used with a bar graph. 也可以使用与柱状图类似的方法缩放线图。
Queries may also use background data in conjunction with named graphs. 查询也可以把后台数据和命名图结合在一起使用。
They created real-time, console-displayed graphs and tables. 他们创建实时的,显示在控制台上的图和表。
For this demonstration, I will present the graphs using a Web server. 在本文中,我将使用Web服务器提供图形。
You can clearly see the difference in the two graphs. 您可以清楚地看到两个图形中的差异。
The graphs also indicate whether or not you need a college degree. 这些图片也显示了你是否需要一个大学学位。
Graphs show forces, energy and work. 图上显示力、能和功。
This paper proposed a domain ontology construction method based on knowledge graphs. 提出了一种基于知识图的领域本体半自动构建方法。
I also created some basic graphs to show trends. 同时我也画了一些基本的图表来显示趋势。
We may thereby compute the number of graphs which are isomorphic to their complements. 因此我们可以计算同构于其补的图的数目。
Most of these methods are based on the same fundamentality as the SDG ( Signed Directed Graphs). 这些方法中的大多数与SDG(符号定向图)在根本原理上相同。
Solution for creating marketing diagrams, charts, graphs, and forms. 用来创建营销示意图、图表、图形和表格的解决方案。
This paper gives necessary and sufficient conditions of strongly connected graphs and primitive graphs through degree sequences. 本文通过度序列分别给出一个图是强连通图和本原图的充要条件。
The classification of distance regular graphs is one of the most important problem at all. 距离正则图的分类问题一直是距离正则图研究中的一个重要的问题。
We give a proof of some upper bounds for the spectral radius of graphs. 该文给出了图的谱半径的一个可达上界的证明。
He has included a thorough market analysis and several statistical graphs and charts. 他还附上了一份详细的市场分析和一些统计数字与图表。
The date range and comparison date ranges you select will apply to all your reports and graphs. 日期范围和比较日期范围选择将适用于所有在您的报告和图表。
In this paper, we give the formulas to compute the Fractional chromatic number of some particular graphs. 本文研究了一些特殊图形的分数色数,给出了计算这些图形分数色数的公式,并且对公式进行了证明。
Two graphs are isomorphic if there is a correspondence between their vertex sets that preserves adjacency. 如果在两个图之间存在一个保持邻接性的1-1对应,则这两个图是同构的。
Focal Point presents data in a series of preconfigured charts and graphs. 重点提供一系列预置的图表和图形数据。
We shall consider partitions of the edges of graphs and hypergraphs. 我们将考虑图和超图的边的划分。
The upper bound of conditional chromatic number of graphs and the graphs satisfying this bound are obtained. 得到了图的条件色数的上界和达到上界的图类。
First, he introduced the differences among dummy reality, computer graphs and pictures. 首先他介绍了虚拟现实、计算机图形和图像之间的区别。
Literature [ 2] has used the adjacent matrix of 4-reGular Graphs to prove this conclusion; 文献[2]利用4正则图的邻接矩阵论证了这一结论;
The chromatic theory of graphs is one of the most important branches of Graph Theory. 图的着色理论是图论的重要分支之一,是图论研究中的最活跃的课题之一。