Related papers: A binomial Laurent phenomenon algebra associated t…
Comparability graphs are a popular class of graphs. We introduce as the digraph analogue of comparability graphs the class of comparability digraphs. We show that many concepts such as implication classes and the knotting graph for a…
In this paper, we introduce a C*-algebra associated to any substitution (via its Bratteli diagram model). We show that this C*-algebra contains the partial crossed product C*-algebra of the corresponding Bratteli-Vershik system and show…
We study algebraic isomonodromic deformations of flat logarithmic connections on the Riemann sphere with $n\geq 4$ poles, for arbitrary rank. We introduce a natural property of algebraizability for the germ of universal deformation of such…
The paper investigates relationship between algebraic expressions and graphs. We consider a digraph called a full square rhomboid that is an example of non-series-parallel graphs. Our intention is to simplify the expressions of full square…
In this paper, we introduce a graph structure called linear dependence graph of a finite dimensional vector space over a finite field. Some basic properties of the graph like connectedness, completeness, planarity, clique number, chromatic…
We give a non-abelian analogue of Whitney's 2-isomorphism theorem for graphs. Whitney's theorem states that the cycle space determines a graph up to 2-isomorphism. Instead of considering the cycle space of a graph which is an abelian…
This thesis concerns the study of homogeneous factorisations of complete graphs with edge-transitive factors. A factorisation of a complete graph $K_n$ is a partition of its edges into disjoint classes. Each class of edges in a…
The aim of this paper is to consider the relation between Lie-isoclinism and isomorphism of two pairs of Leibniz algebras. We show that, unlike the absolute case for finite dimensional Lie algebras, these concepts are not identical, even if…
We characterize all partitions of the complete twisted graph $T_{2n}$ into plane spanning trees. In the case of partitions of $T_{2n}$ into isomorphic plane spanning trees, we show that all trees in these partitions must be balanced double…
In this article, we introduce a relation including ideals of an evolution algebra and hereditary subsets of vertices of its associated graph and establish some properties among them. This relation allows us to determine maximal ideals and…
For each positive integer $n$, the Fibonacci-sum graph $G_n$ on vertices $1,2,\ldots,n$ is defined by two vertices forming an edge if and only if they sum to a Fibonacci number. It is known that each $G_n$ is bipartite, and all Hamiltonian…
Counting dominating sets in a graph $G$ is closely related to the neighborhood complex of $G$. We exploit this relation to prove that the number of dominating sets $d(G)$ of a graph is determined by the number of complete bipartite…
Given a graph E we define E-algebraic branching systems, show their existence and how they induce representations of the associated Leavitt path algebra. We also give sufficient conditions to guarantee faithfulness of the representations…
Leibniz algebras are certain generalization of Lie algebras. It is natural to generalize concepts in Lie algebras to Leibniz algebras and investigate whether the corresponding results still hold. In this paper we introduce the notion of…
In this paper we investigate the connectedness and the isomorphism problems for zig-zag products of two graphs. A sufficient condition for the zig-zag product of two graphs to be connected is provided, reducing to the study of the…
We characterize some asymptotic properties of edge exchangeable random graphs in terms of the measure used to generate them. In particular, we give a necessary and sufficient condition for eventual forever connectedness, a sufficient…
This paper explores a particular statistical model on 6-valent graphs with special properties which turns out to be invariant with respect to certain Roseman moves if the graph is the singular point graph of a diagram of a 2-knot. The…
We show that almost surely the rank of the adjacency matrix of the Erd\"os-R\'enyi random graph $G(n,p)$ equals the number of non-isolated vertices for any $c\ln n/n<p<1/2$, where $c$ is an arbitrary positive constant larger than 1/2. In…
We prove two conjectures in spectral extremal graph theory involving the linear combinations of graph eigenvalues. Let $\lambda_1(G)$ be the largest eigenvalue of the adjacency matrix of a graph $G$, and $\bar{G}$ be the complement of $G$.…
Chord diagrams and related enlacement graphs of alternating knots are enhanced to obtain complete invariant graphs including chirality detection. Moreover, the equivalence by common enlacement graph is specified and the neighborhood graph…