Quandle coloring quivers of surface-links

Quandle coloring quivers are directed graph-valued invariants of oriented knots and links, defined using a choice of finite quandle [Formula: see text] and set [Formula: see text] of endomorphisms. From a quandle coloring quiver, a polynomial knot invariant known as the in-degree quiver polynomial is defined. We consider quandle coloring quiver invariants for oriented surface-links, represented by marked graph diagrams. We provide example computations for all oriented surface-links with ch-index up to 10 for choices of quandles and endomorphisms.

2-Knot homology and Yoshikawa move

Ng constructed an invariant of knots in [Formula: see text], a combinatorial knot contact homology. Extending his study, we construct an invariant of surface-knots in [Formula: see text] using marked graph diagrams.

GENERALIZED FUNCTIONAL MODEL OF CHEMICAL MANUFACTURING AND ITS SETTHEORETIC REPRESENTATION

The mechanism of constructing functional models in the IDEF0 notation is considered. The process of creating a marked graph is described, it includes adding service vertices and arcs by converting the graph from a separate diagram. A generalized functional model of one-stage chemical production has been developed. A settheoretic description of a graph describing a top-level functional model is presented.

Знаковые графы эквивалентности степени тоша

The Tosha-degree of an edge $\alpha $ in a graph $\Gamma$ without multiple edges, denoted by $T(\alpha)$, is the number of edges adjacent to $\alpha$ in $\Gamma$, with self-loops counted twice. A signed graph (marked graph) is an ordered pair $\Sigma=(\Gamma,\sigma)$ ($\Sigma =(\Gamma, \mu)$), where $\Gamma=(V,E)$ is a graph called the underlying graph of $\Sigma$ and $\sigma : E \rightarrow \{+,-\}$ ($\mu : V \rightarrow \{+,-\}$) is a function. In this paper, we define the Tosha-degree equivalence signed graph of a given signed graph and offer a switching equivalence characterization of signed graphs that are switching equivalent to Tosha-degree equivalence signed graphs and $ k^{th}$ iterated Tosha-degree equivalence signed graphs. It is shown that for any signed graph $\Sigma$, its Tosha-degree equivalence signed graph $T(\Sigma)$ is balanced and we offer a structural characterization of Tosha-degree equivalence signed graphs

Generalizations of a Conway algebra for oriented surface-links via marked graph diagrams

In 1987, Przytyski and Traczyk introduced an algebraic structure, called a Conway algebra, and constructed an invariant of oriented links, which is a generalization of the HOMFLY-PT polynomial invariant. In 2018, Kim generalized a Conway algebra, which is an algebraic structure with two skein relations, which is called a generalized Conway algebra. In 2017, Joung, Kamada, Kawauchi and Lee constructed a polynomial invariant of oriented surface-links by using marked graph diagrams. In this paper, we will introduce generalizations [Formula: see text] and [Formula: see text] of a Conway algebra and a generalized Conway algebra, which are called a marked Conway algebra and a generalized marked Conway algebra, respectively. We will construct invariants valued in [Formula: see text] and [Formula: see text] for oriented marked graphs and oriented surface-links by applying binary operations to classical crossings and marked vertices via marked graph diagrams. The polynomial invariant of oriented surface-links is obtained from the invariant valued in the marked Conway algebra with additional conditions.

Biquandle cohomology and state-sum invariants of links and surface-links

In this paper, we discuss the (co)homology theory of biquandles, derived biquandle cocycle invariants for oriented surface-links using broken surface diagrams and how to compute the biquandle cocycle invariants from marked graph diagrams. We also develop the shadow (co)homology theory of biquandles and construct the shadow biquandle cocycle invariants for oriented surface-links.

Presentation of immersed surface-links by marked graph diagrams

It is well known that surface-links in [Formula: see text]-space can be presented by diagrams on the plane of [Formula: see text]-valent spatial graphs with makers on the vertices, called marked graph diagrams. In this paper, we extend the method of presenting surface-links by marked graph diagrams to presenting immersed surface-links. We also give some moves on marked graph diagrams that preserve the ambient isotopy classes of their presenting immersed surface-links.

Edge Irregular Reflexive Labeling for the Disjoint Union of Gear Graphs and Prism Graphs

In graph theory, a graph is given names—generally a whole number—to edges, vertices, or both in a chart. Formally, given a graph G = ( V , E ) , a vertex naming is a capacity from V to an arrangement of marks. A diagram with such a capacity characterized defined is known as a vertex-marked graph. Similarly, an edge naming is a mapping of an element of E to an arrangement of marks. In this case, the diagram is called an edge-marked graph. We consider an edge irregular reflexive k-labeling for the disjoint association of wheel-related diagrams and deduce the correct estimation of the reflexive edge strength for the disjoint association of m copies of some wheel-related graphs, specifically gear graphs and prism graphs.