In this study, a set of SRII methods is proposed based on the graph theory definition of similarity and isomorphism. These are appropriate for planar single and multiple joints KCs, planetary gear trains (PGTs), contracted graphs, and multicolor graphs. The computational complexity and ...
"同形相似",1822年,出现在约翰·乔治·奇尔德(John George Children)翻译的贝采利乌斯(Berzelius)的《化学分析中吹管的使用》一书中,该书是从法语翻译而来,法语中的 l'isomorphisme,源自德语 Isomorphismus(1819),由德国化学家艾尔哈德·米切尔里希(Eilhard Mitscherlich)(1794-1863)创造,由希腊语 isos “相等的,相同...
Graph Theory | Vertices, Edges & Applications8:08 Graphs in Discrete Math: Definition, Types & Uses6:06 Isomorphism & Homomorphism in Graphs 6:11 Next Lesson Euler Path vs. Circuit | Differences & Examples Mathematical Models of Euler's Circuits & Euler's Paths6:54 ...
Dima Grigoriev,Laszlo Babai,David Mount - 《Proc.annual Acm Symp.on Theory of Computing》 被引量: 257发表: 1982年 Proceedings of the fourteenth annual ACM symposium on Theory of computing We investigate the connection between the spectrum of a graph, i.e. the eigenvalues of the adjacency ma...
Proof: By definition, two groups areisomorphic if there exist a 1-1 onto mapping ϕ from one group to the other. In order for us to have 1-1 onto mapping we need that the number of elements in one group equal to the number of the elements of the other group. Thus, the two grou...
Based on the definition of subgraph isomorphism, we can give the definition of a frequent subgraph mining as follows. Definition 21: Frequent subgraph mining for composite service. Given a composite service graph dataset D = {G1, G2,…, Gn}, and a minimum support min_sup, assume sup(g)...
The rest of the paper is organized as follows: Section 2 describes the basic concepts of graph theory. In Section 3, the initial value rule and the definition of AMAVS of topological graphs are presented, and several examples are delivered to illustrate the detection of similar vertices. In ...
Two simple graphs, G and H, each of which have n vertices (with n a positive integer greater than 3) are called a graph pair of order n if the following three conditions all hold: (1) G and H union to the complete graph, (2) G and H have no isolated vertices, and (3) G is...
However, a multilayer network may represent an exception if its own objects consists of heterogeneous entities, as the heterophily will be essential for the definition of the interlayer edges and cannot be omitted in the similarity analysis; by extension, the same issue concerns heterogeneous ...
Basic Representation Theory of Groups and Algebras In Pure and Applied Mathematics, 1988 2.8 Definition Let G and K be two topological groups. A group isomorphism f of G onto K which is also a homeomorphism is called an isomorphism of topological groups. If such an isomorphism f exists, we ...