Diagonal and Graph Automorphisms for Case O ˘
Eulerian graphs and automorphisms of a maximal graph
... A graph is said to be connected if there is at least one path between every pair of vertices in ...connected graph is the supremum of the distances between ...
12
Automorphisms of Submanifolds
... of automorphisms together with the relevant infinitesimal ...generalized automorphisms if and only if certain finite-dimensional subspaces depending on the group under consideration are preserved Figure ...
26
AUTOMORPHISMS OF DISTANCE-REGULAR GRAPH WITH INTERSECTION ARRAY {39; 36; 4; 1; 1; 36}
... with automorphisms of a distance-regular graph, presented in the third chapter of Cameron’s book ...distance-regular graph of diameter d with v ...of graph Γ i ...
10
Automorphisms of kaleidoscopical graphs
... • for every finitely generated group H, there exists a kaleidoscopical graph Γ such that Aut(Γ) = H. 2. Kaleidoscopical and Hamming pairs Let G be a group with the identity e and let X, Y be subsets of G. We say ...
5
The automorphisms of Petit's algebras
... the automorphisms of nonassociative unital algebras which are canonical generalizations of the associative quotient algebras K[t; σ]/f K[t;σ] obtained when the twisted polynomial f ∈ K[t;σ] is invariant, and were ...
18
Case Study on Graph Processing Using Graph Engine
... on Graph Processing Using Graph Engine ...the Graph Engine, developed by Microsoft. This organizes data in a graph format on multiple machines, making it a distributed ...database. ...
5
Two-fold automorphisms of graphs
... and this happens when G has non-trivial TF-automorphisms. This is the situation which we shall investigate below. The next result is a sort of inverse to the previous one. Proposition 1.5. Let G be a bipartite ...
12
Automorphisms with exotic orbit growth
... on the count of closed orbits via the relation (1.2) is more involved. We write | x | S ± p P S | x | p for convenience, and since we will be using the same underlying map throughout, we will replace T T S by the parame- ...
29
Dynamical invariants for group automorphisms
... classify automorphisms of compact abelian groups from a dynamical point of ...particular case of automorphisms of one-dimensional solenoids, a complete description is given and the problem of ...
28
Automorphisms and Isomorphisms of Enhanced Hypercubes
... Cayley graph over Z n 2 with generating set S k = {e 1 , ...Cayley graph Γ = Cay(Z n 2 , T), if Γ and Γ n,k share the same spectrum, then Γ Γ n,k ...
8
Automorphisms and coverings of Klein surfaces
... the case when is orientable, if g \ i s a generator of , FUgF is a fundamental region for and there exists an x which is orientation reversing and maps one side of FUgF to ...
20
Automorphisms and coverings of Klein surfaces
... the case when # 1 is orientable, if g & # 1 \ # 2 i s a generator of # 1 , FUgF is a fundamental region for # 2 and there exists an x & # 2 which is orientation reversing and maps one side of FUgF to ...
119
On the Conjugacy Problem for Automorphisms of Trees
... In this chapter, we will make clear what we meant by reduction in the previous chapter as well as introduce the basic theory of Borel reducibility. A reduction between two equivalences relations is a mapping between the ...
58
Node Embeddings for Graph Merging: Case of Knowledge Graph Construction
... recover the one (or none) final match for each method. 3.1 Evaluation Evaluation of information graph building methods is inherently challenging in the absence of gold- standard KGs. In our experimental setting ...
5
Control Flow Graph, Static Call Graph, Test Case Generation
... Abstract— In software development, a software testing is a mandatory process to indicate the quality level of the software and to verify that all components have been working properly. For integration testing, it is a ...
5
3 Reconstruction, and full groups of automorphisms
... The sets of points and lines of the doily W can be interpreted as the two con- jugacy classes (represented by (01) and (01)(23)(45), respectively) of involutions in S 6 A 6 ; two such involutions from different classes ...
20
Computing automorphisms of finite soluble groups
... W hen M = N th is algorithm com putes a basis for th e endom orphism algebra of M . W hen th e dim ension of M is large, th e calculations described above becom e quite tim e consum ing and b e tte r techniques are ...
96
On the lattice automorphisms of certain algebraic groups
... in O have the same length ...existence o f a graph automorphism 5 such that X ,8 - Xa(r) for every simple root r of o f the graph automorphism 8 ...
148
Outline 2.1 Graph Isomorphism 2.2 Automorphisms and Symmetry 2.3 Subgraphs, part 1
... STRUCTURE AND REPRESENTATION — PART A Abstract. Chapter 2 focuses on the question of when two graphs are to be regarded as “the same”, on symmetries, and on subgraphs. §2.1 discusses the concept of graph ...
32
AUTOMORPHISMS OF DISTANCE-REGULAR GRAPH WITH INTERSECTION ARRAY {25; 16; 1; 1; 8; 25}
... [email protected] Abstract: Makhnev and Samoilenko have found parameters of strongly regular graphs with no more than 1000 vertices, which may be neighborhoods of vertices in antipodal distance-regular graph of ...
6