Related papers: An alternative construction of the $G_2(2)$-graph

We introduce the concept of G2(2)-structure on an orientable 3-manifold M using the setting of generalized geometry of type Bn, study their local deformation by making use of a Moser-type argument, and give a description of the cone of…

In this paper, we construct additively graceful signed graphs S from a given graph G that may be additively graceful or not be additively graceful. We also show the construction of additively graceful signed graphs from additively graceful…

In this note we propose an $\omega$-operadical way to prove the existence of the $\omega$-graph of the $\omega$-graphs and the reflexive $\omega$- graph of the reflexive $\omega$-graphs.

We present a edge-coloured analogue of the duality theorem for transitive tournaments and directed paths. Given a edge-coloured path $P$ whose edges alternate blue and red, we construct a edge-coloured graph $D$ so that for any…

This paper presents a method for constructing flat deformations of associative algebras. We will refer to this method as method two because it is a generalisation of the method obtained in [1]. The deformations obtained using the first two…

In this paper, we give several constructions for the pairs of graphs to be equienergetic and Randic' equienergetic graphs. Also, some new families of integral and Randic' integral graphs are obtained. As an application, a sequence of graphs…

A construction of Alon yields a sequence of highly pseudorandom triangle-free graphs with edge density significantly higher than one might expect from comparison with random graphs. We give an alternative construction for such graphs.

In our previous publications we have introduced analogs of partial derivatives on the algebras U(gl(N)). In the present paper we compare two methods of introducing these analogs: via the so-called quantum doubles and by means of a…

We show that a connected regular $A_2$-crystal (the crystal graph of an irreducible representation of $sl_3$) can be produced from two half-grids by replicating them and glying together in a certain way. Also some extensions and related…

In this dissertation, we explore the structure of inversion graphs of permutations--a class of graphs that naturally arises by representing each permutation as a graph, where vertices correspond to entries and edges encode inversions.…

In this paper, we will consider the graph w*-probability theory.

We construct a compact example of 7- dimensional manifold endowed with a weakly integrable generalized G_2-structure with respect to a closed and non trivial 3-form. Moreover, we investigate which type of SU(3)-structures on a 6-dimensional…

Generalizing Jones's notion of a planar algebra, we have previously introduced an A_2-planar algebra capturing the structure contained in the double complex pertaining to the subfactor for a finite SU(3) ADE graph with a flat cell system.…

For a group $G$, we construct a quasi morphism from its left orderings and the map from the space of left orderings to the second bounded cohomology. We show that these maps reflect various properties of the group orderings.

Any graph which is not vertex transitive has a proper induced subgraph which is unique due to its structure or the way of its connection to the rest of the graph. We have called such subgraph as an anchor. Using an anchor which, in fact, is…

In the paper, we provide an alternative and united proof of a double inequality for bounding the arithmetic-geometric mean.

We study the enumerative geometry of orbits of multidimensional toric action on projective algebraic varieties and develop a new cyclic differential-graded operad, conjecturally governing the real version of the enumerative geometry of…

An arithmetical structure on a graph is given by a labeling of the vertices which satisfies certain divisibility properties. In this note, we look at several families of graphs and attempt to give counts on the number of arithmetical…

In this paper we deal with the Wedderburn b-decomposition for alternative baric algebras.

A graph is $\ell$-reconstructible if it is determined by its multiset of induced subgraphs obtained by deleting $\ell$ vertices. We prove that $3$-regular graphs are $2$-reconstructible.