Related papers: Alternative links, homogeneous links, and graphs
The concept of coreflexive set is introduced to study the structure of digraphs. New characterizations of line digraphs and nth-order line digraphs are given. Coreflexive sets also lead to another natural way of forming an intersection…
Homomorphically full graphs are those for which every homomorphic image is isomorphic to a subgraph. We extend the definition of homomorphically full to oriented graphs in two different ways. For the first of these, we show that…
Using basic topology and linear algebra, we define a plethora of invariants of boundary links whose values are power series with noncommuting variables. These turn out to be useful and elementary reformulations of an invariant originally…
An equivalent description of a symmetric monoidal category is introduced in which, instead of separate associator and commutator isomorphisms satisfying the usual coherence axioms, we simply have associo-commutator isomorphisms satisfying…
The axiomatic approach to parallel transport theory is partially discussed. Bijective correspondences between the sets of connections, (axiomatically defined) parallel transports, and transports along paths satisfying some additional…
An oriented hypergraph is a hypergraph where each vertex-edge incidence is given a label of $+1$ or $-1$. We define the adjacency, incidence and Laplacian matrices of an oriented hypergraph and study each of them. We extend several matrix…
We call a 2-partite digraph D homogeneous if every isomorphism between finite induced subdigraphs that respects the 2-partition of D extends to an automorphism of D that does the same. In this note, we classify the homogeneous 2-partite…
In this article we introduce the notion of weak harmonic labeling of a graph, a generalization of the concept of harmonic labeling defined recently by Benjamini et al. that allows extension to finite graphs and graphs with leaves. We…
A concept of implicit links for Complex Networks has been defined and a new value - cohesion factor, which allows to evaluate numerically the presence of such connection between any two nodes, has been introduced. We introduce a…
This paper describes the design and implementation of a new machine learning model for online learning systems. We aim at improving the intelligent level of the systems by enabling an automated math word problem solver which can support a…
The complexity of the list homomorphism problem for signed graphs appears difficult to classify. Existing results focus on special classes of signed graphs, such as trees and reflexive signed graphs. Irreflexive signed graphs are in a…
In this paper, subgraphs and complementary graphs are used to analyze the network synchronizability. Some sharp and attainable bounds are provided for the eigenratio of the network structural matrix, which characterizes the network…
In this paper, a relationship between the determinant of an alternating link and a certain polytope obtained from the link diagram is analyzed. We also show that when the underlying graph of the link diagram is properly oriented, the number…
Let $G$ be a finite group. A number of graphs with the vertex set $G$ have been studied, including the power graph, enhanced power graph, and commuting graph. These graphs form a hierarchy under the inclusion of edge sets, and it is useful…
We give a sufficient condition for an almost alternating link diagram to represent a non-splittable link. The main theorem gives us a way to see if a given almost alternating link diagram represents a splittable link without increasing…
We extend the clique-coclique inequality, previously known to hold for graphs in association schemes and vertex-transitive graphs, to graphs in homogeneous coherent configurations and 1-walk regular graphs. We further generalize it to a…
A self-contained graph is an infinite graph which is isomorphic to one of its proper induced subgraphs. In this paper, these graphs are studied by presenting some examples and defining some of their sub-structures such as removable…
A discussion given to the question of extending Khovanov homology from links to embedded graphs, by using the Kauffman topological invariant of embedded graphs by associating family of links and knots to a such graph by using some local…
We classify the indexed links corresponding to the union of the closed orbits of non-singular Morse-Smale flows on most graph manifolds. We find that each of this kind of indexed links can be obtained by applying a finite steps of…
We consider invariant covariant derivatives on reductive homogeneous spaces corresponding to the well-known invariant affine connections. These invariant covariant derivatives are expressed in terms of horizontally lifted vector fields on…