Related papers: Interlacement in 4-regular graphs: a new approach …
A new technique for approximating the entire solution set for a nonlinear system of relations (nonlinear equations, inequalities, etc. involving algebraic, smooth, or even continuous functions) is presented. The technique is to first plot…
Nested graphs have been used in different applications, for example to represent knowledge in semantic networks. On the other hand, graphs with cycles are really important in surface reconstruction, periodic schedule and network analysis.…
I will present a way to implement graph algorithms which is different from traditional methods. This work was motivated by the belief that some ideas from software engineering should be applied to graph algorithms. Re-usability of software…
The Laplacian matrix $L$ of a signed graph $G$ may or may not be invertible. We present a combinatorial formula of the Moore-Penrose inverse of $L$. This is achieved by finding a combinatorial formula for the Moore-Penrose inverse of an…
The incidence matrix of a graph is totally unimodular if and only if the graph is bipartite, i.e., it contains no odd cycles. We extend the characterization of total unimodularity to hypergraphs whose hyperedges of size at least four are…
In this paper, we consider the problem of determining in polynomial time whether a given planar point set $P$ of $n$ points admits 4-connected triangulation. We propose a necessary and sufficient condition for recognizing $P$, and present…
We tackle the problem of attributed graph transformations and propose a new algorithmic approach for defining parallel graph transformations allowing overlaps. We start by introducing some abstract operations over graph structures. Then, we…
In order to study real-world systems, many applied works model them through signed graphs, i.e. graphs whose edges are labeled as either positive or negative. Such a graph is considered as structurally balanced when it can be partitioned…
In many field theoretical models one has to resum two- and four-legged subdiagrams in order to determine their behaviour. In this article we present a novel formalism which does this in a nice way. It is based on the central limit theorem…
The paper gives a thorough introduction to spectra of digraphs via its Hermitian adjacency matrix. This matrix is indexed by the vertices of the digraph, and the entry corresponding to an arc from $x$ to $y$ is equal to the complex unity…
Euler angles determining rotations of a system as a whole are conveniently separated in three-particle basis functions. Analytic integration of matrix elements over Euler angles is done in a general form. Results for the Euler angle…
We give a linear-time algorithm that checks for isomorphism between two 0-1 matrices that obey the circular-ones property. This algorithm leads to linear-time isomorphism algorithms for related graph classes, including Helly circular-arc…
This paper considers *-graphs in which all vertices have degree 4 or 6, and studies the question of calculating the genus of orientable 2-surfaces into which such graphs may be embedded. A *-graph is a graph endowed with a formal adjacency…
We are interested in multilayer graph clustering, which aims at dividing the graph nodes into categories or communities. To do so, we propose to learn a clustering-friendly embedding of the graph nodes by solving an optimization problem…
In a recent paper, a new method was proposed to find the common invariant subspaces of a set of matrices. This paper invstigates the more general problem of putting a set of matrices into block triangular or block-diagonal form…
The recent advances in modelling nonlinear interference of systems operating beyond the C-band are discussed. Estimation accuracy as well as computational complexity of current approaches are compared and addressed.
Consider a graph drawn on a surface (for example, the plane minus a finite set of obstacle points), possibly with crossings. We provide an algorithm to decide whether such a drawing can be untangled, namely, if one can slide the vertices…
It is shown how strictly four-dimensional integration by parts combined with differential renormalization and its infrared analogue can be applied for calculation of Feynman diagrams.
The inverse eigenvalue problem of a graph $G$ is the problem of characterizing all lists of eigenvalues of real symmetric matrices whose off-diagonal pattern is prescribed by the adjacencies of $G$. The strong spectral property is a…
In this paper, we show that one can interrelate pluriharmonic maps with para-pluriharmonic maps by means of the loop group method. As an appendix, we give examples for the interrelation between pluriharmonic maps and para-pluriharmonic…