查询词典 complementary graph

Then with the scale transformation method,the anticlastic "1-9 scale" is transformed to complementary "0.1-0.9 nine scales",which constitutes fuzzy complementary judgment matrix associated with the...

然后，利用标度转化法，将互反性的&1～9标度&转化为互补性的&0.1～0.9九标度，&再利用后者与指标体系建立模糊互补判断矩阵，并对该矩阵进行模糊层次分析，从而将模糊层次分析法引入到了初始水权分配领域。

We construct a Salop model to analyze three conditions: no-fee, foreign fee, and surcharge. Our meaningful conclusions mainly are: When the interchange fee is equal to ATM's marginal cost, the bank's profit could be maximized; for pure ATM businesses, foreign fee is strategy-substitutable and surcharge is strategy-complementary; for banking competition, foreign fee is strategy-complementary and surcharge is strategy-substitutable.Keywords: ATM, foreign fee, surchargeJEL Number:

本文以Salop环形城市模型分析了跨行取款不收费制、跨行费制、额外费制下银行在ATM业务上的成本收益情况，本文有意义的结论主要有：当交换费等于ATM的边际成本时，两种费制都会使银行达到利润最大化；在纯粹ATM业务上，跨行费是战略替代的，额外费是战略互补的；在银行竞争上，跨行费是战略互补的，额外费是战略替代的。

The set of jobs is specified using a directed acyclic graph, where each job is a node in the graph.

任务集是通过一个有向无环图来定义的，每个任务就是图中的一个节点。

As the graph of Bayesian network is required to be a directed acyclic graph, which was changed during the constructing process, checking for cycle is need in the interaction.

由于贝叶斯网的网络结构要求为一有向无环图，并且此图在交互建网过程中时刻变化，所以要在交互过程中反复检测环路是否存在。

The commit objects form a directed acyclic graph, because they have parents, and the graph of commit objects is acyclic (there is no chain which begins and ends with the same object).

交付对象是按一个单向非环路是图的形式来组织的，因为他们有父辈，以及非环路视图（不存在开始和结尾都是同一个对象的情况）。

The spectral graph theory is one of the main branches in algebraic graph theory, it is mainly concerned with the adjacency spectrum and the Laplacian spectrum.

图的谱理论是代数图论中的一个重要课题，主要涉及图的邻接谱与图的Laplacian谱的研究。

The study of graph spectra is an important direction of research in algebraic graph theory, and its main object of study is the adjacency spectrum and the Laplacian spectrum.

对图谱的研究是代数图论中的一个重要研究方向，其主要研究对象是图的邻接谱与图的Laplacian谱。

In the third chapter, we shall define the concepts of the adjacent vertex distinguishing incidence coloring and the adjacent vertex distinguishing incidence chromatic number of graphs: For graph G, let Q_u={|u"∈N}U{|u∈N},σ: I→C is a k- incidence coloring of graph G, C_u denotes the set of colors assigned to Q_u.

在第三章中我们将定义图的邻点可区别关联着色及邻点可区别关联色数：对图G，设Q_u={|u"∈N}∪{|u∈N}，σ：I→C为图G的k-关联着色，C_u表示着在Q_u上的色集。

The study of molecular topological indices and the invariants of molecular graph is one of the most active area in the modern chemical graph theory.

分子拓扑指数以及分子图的不变量的研究是现代化学图论中最活跃的研究领域之一。

On this foundation, the paper proposes distinguishing the shape of the graph by using the graph area and the perimeter ratio scope.

在此基础上提出了利用图形的面积和周长的比值范围来识别出图形的形状。

I can do simple painting, carpentry and plumbing.

我能做简单的油漆、木工和修水管等工作。

The motivations, notations and outline of this work are also given in this chapter.

从这个意义上讲，这些时滞是无害的。然后用实例说明这三个定理的应用和互不包含性。