相关论文: Knots in lattice homology
Graph connectivity is a fundamental combinatorial optimization problem that arises in many practical applications, where usually a spanning subgraph of a network is used for its operation. However, in the real world, links may fail…
A geometric grid class consists of those permutations that can be drawn on a specified set of line segments of slope \pm1 arranged in a rectangular pattern governed by a matrix. Using a mixture of geometric and language theoretic methods,…
We consider the lattice of all the weak factorization systems on a given finite lattice. We prove that it is semidistributive, trim and congruence uniform. We deduce a graph theoretical approach to the problem of enumerating transfer…
The zero forcing number Z(G), which is the minimum number of vertices in a zero forcing set of a graph G, is used to study the maximum nullity / minimum rank of the family of symmetric matrices described by G. It is shown that for a…
Given $\mathbf{n}=(n_{1},\ldots,n_{r})\in\mathbb{N}^r$, let $\Gamma_{\mathbf{n}}$ be a group presentable as $$\left\langle \gamma_{1},\ldots,\gamma_{r}\:|\:\gamma_{1}^{n_{1}}=\gamma_{2}^{n_{2}}=\cdots=\gamma_{r}^{n_{r}}\right\rangle. $$ If…
Let N be a regular branched cover of a homology 3-sphere M with deck group G isomorphic to Z_2^d and branch set a trivalent graph Gamma; such a cover is determined by a coloring of the edges of Gamma with elements of G. For each index-2…
The intersection graph of a collection of trapezoids with corner points lying on two parallel lines is called a trapezoid graph. These graphs and their generalizations were applied in various fields, including modeling channel routing…
A discrete subgroup $\Gamma$ of a locally compact group $H$ is called a uniform lattice if the quotient $H/\Gamma$ is compact. Such an $H$ is called an envelope of $\Gamma$. In this paper we study the problem of classifying envelopes of…
We define the action of the homology group $H_1(M,\partial M)$ on the sutured Floer homology $SFH(M,\gamma)$. It turns out that the contact invariant $EH(M,\gamma,\xi)$ is usually sent to zero by this action. This fact allows us to refine…
The $G$-graph $\Gamma(G,S)$ is a graph from the group $G$ generated by $S\subseteq G$, where the vertices are the right cosets of the cyclic subgroups $\langle s \rangle, s\in S$ with $k$-edges between two distinct cosets if there is an…
Let $G=(V(G),E(G))$ be a simple graph. A non-empty set $S\subseteq V (G)$ is a weakly connected dominating set in $G$, if the subgraph obtained from $G$ by removing all edges each joining any two vertices in $V (G)\setminus S$ is connected.…
We introduce the factorization graph of a finite group and study its connectedness and forbidden structures. We characterize all finite groups with connected factorization graphs and classify those with connected bipartite factorization…
Let $\Gamma$ be an undirected and simple graph. A set $ S $ of vertices in $\Gamma$ is called a {cyclic vertex cutset} of $\Gamma$ if $\Gamma - S$ is disconnected and has at least two components each containing a cycle. If $\Gamma$ has a…
We propose an approach to learning with graph-structured data in the problem domain of graph classification. In particular, we present a novel type of readout operation to aggregate node features into a graph-level representation. To this…
We study the problem of conjunctive query evaluation relative to a class of queries; this problem is formulated here as the relational homomorphism problem relative to a class of structures A, wherein each instance must be a pair of…
We consider homomorphisms of signed graphs from a computational perspective. In particular, we study the list homomorphism problem seeking a homomorphism of an input signed graph $(G,\sigma)$, equipped with lists $L(v) \subseteq V(H), v \in…
If a graph has a non-singular adjacency matrix, then one may use the inverse matrix to define a (labeled) graph that may be considered to be the inverse graph to the original one. It has been known that an adjacency matrix of a tree is…
We propose a new method of computing cohomology groups of spaces of knots in $\R^n$, $n \ge 3$, based on the topology of configuration spaces and two-connected graphs, and calculate all such classes of order $\le 3.$ As a byproduct we…
We determine all graphs whose matching polynomials have at most five distinct zeros. As a consequence, we find new families of graphs which are determined by their matching polynomial.
Centrality describes the importance of nodes in a graph and is modeled by various measures. Its global analogue, called centralization, is a general formula for calculating a graph-level centrality score based on the node-level centrality…