Related papers: Introducing a vertex polynomial invariant for embe…
We study the problem of transforming bipartite graphs into bicluster graphs. Abu-Khzam, Isenmann, and Merchad [IWOCA '25] introduced two variants of this problem. In both problems, the goal is to transform a bipartite graph into a bicluster…
We strengthen and put in a broader perspective previous results of the first two authors on colliding permutations. The key to the present approach is a new non-asymptotic invariant for graphs.
In this paper, we discuss twisted Alexander polynomials of a knot for group extensions of a finite group in two directions. Firstly, we provide a mod $p$ formula for the twisted Alexander polynomial of a knot in the $3$-sphere associated…
It is known that every surface-link can be presented by a marked graph diagram, and such a diagram presentation is unique up to moves called Yoshikawa moves. G. Kuperberg introduced a regular isotopy invariant, called the quantum A_2…
Random $s$-intersection graphs have recently received considerable attention in a wide range of application areas. In such a graph, each vertex is equipped with a set of items in some random manner, and any two vertices establish an…
We introduce and study the notion of a dual Feynman transform of a modular operad. This generalizes and gives a conceptual explanation of Kontsevich's dual construction producing graph cohomology classes from a contractible differential…
We study embeddings of a graph $G$ in a surface $S$ by considering representatives of different classes of $H_1(S)$ and their intersections. We construct a matrix invariant that can be used to detect homological invariance of elements of…
We introduce a new bivariate polynomial which we call the defensive alliance polynomial and denote it by da(G; x, y). It is a generalization of the alliance polynomial [Carballosa et al., 2014] and the strong alliance polynomial [Carballosa…
A gain graph is a graph whose edges are orientably labelled from a group. A weighted gain graph is a gain graph with vertex weights from an abelian semigroup, where the gain group is lattice ordered and acts on the weight semigroup. For…
Given a graph and a representation of its fundamental group, there is a naturally associated twisted adjacency operator. The main result of this article is the fact that these operators behave in a controlled way under graph covering maps.…
We provide recipe theorems for the Bollob\`as and Riordan polynomial $\mathcal{R}$ defined on classes of ribbon graphs with half-edges introduced in arXiv:1310.3708[math.GT]. We also define a generalized transition polynomial $Q$ on this…
In an $\mathsf{L}$-embedding of a graph, each vertex is represented by an $\mathsf{L}$-segment, and two segments intersect each other if and only if the corresponding vertices are adjacent in the graph. If the corner of each…
We present a braided circuit topology framework for investigating topology and structural phase transitions in aggregates of semiflexible polymers. In the conventional approach to circuit topology, which specifically applies to single…
There is recent interest in compressing data sets for non-sequential settings, where lack of obvious orderings on their data space, require notions of data equivalences to be considered. For example, Varshney & Goyal (DCC, 2006) considered…
We introduce a novel embedding method diverging from conventional approaches by operating within function spaces of finite dimension rather than finite vector space, thus departing significantly from standard knowledge graph embedding…
Given an input graph and weights on its vertices, the maximum co-2-plex problem is to find a subset of vertices maximizing the sum of their weights and inducing a graph of degree at most 1. In this article, we analyze polyhedral aspects of…
We first recall the basic theory of double vector bundles and the canonical pairing of their duals introduced by the author and by Konieczna and Urbanski. We then show that the relationship between a double vector bundle and its two duals…
In this paper, we study random embeddings of polymer networks distributed according to any potential energy which can be expressed in terms of distances between pairs of monomers. This includes freely jointed chains, steric effects,…
Polynomials on stranded graphs are higher dimensional generalization of Tutte and Bollob\'as-Riordan polynomials [Math. Ann. 323 (2002), 81-96]. Here, we deepen the analysis of the polynomial invariant defined on rank 3 weakly-colored…
We introduce two graph polynomials and discuss their properties. One is a polynomial of two variables whose investigation is motivated by the performance analysis of the Bethe approximation of the Ising partition function. The other is a…