相关论文: Generalizing Kirchhoff laws for Signed Graphs

The $k$-coalescence of two graphs is obtained by merging a $k$-clique of each graph. The $A_\alpha$-matrix of a graph is the convex combination of its degree matrix and adjacency matrix. In this paper, we present some structural properties…

We construct B\"acklund transformations (BTs) for the Kirchhoff top by taking advantage of the common algebraic Poisson structure between this system and the $sl(2)$ trigonometric Gaudin model. Our BTs are integrable maps providing an exact…

Bidirected graphs are multigraphs where every edge has an independent direction at each end. In the paper, with an arbitrary bidirected graph we associate a non-negative integral quadratic form (called the incidence form of the graph), and…

In this paper, we generalize the Kirchhoff-Sobolev parametrix of Klainerman and Rodnianski to systems of tensor wave equations with additional first-order terms. We also present a different derivation, which better highlights that such…

Often topological classes of one-dimensional dynamical systems are finite codimension smooth manifolds. We describe a method to prove this sort of statement that we believe can be applied in many settings. In this work we will implement it…

A bicirculant is a regular, $d$-valent graph that admits a semiregular automorphism of order $m$ having two vertex-orbits of size $m$. The vertices of each orbit induce a circulant graph of order $m$ and the remaining edges span a regular…

In this paper we consider the nonlinear Klein-Gordon equation on the metric star graph with tree semi-infinite bonds. At the branched point we put two types of vertex boundary conditions: the weight continuity and the condition for…

In the setting of abstract Markov maps, we prove results concerning the convergence of renormalized Birkhoff sums to normal laws or stable laws. They apply to one-dimensional maps with a neutral fixed point at 0 of the form…

In this paper, we study the signed total domination number in graphs and present new sharp lower and upper bounds for this parameter. For example by making use of the classic theorem of Turan, we present a sharp lower bound on this…

A few steps are made towards representation theory of embeddability among uncountable graphs. A monotone class of graphs is defined by forbidding countable subgraphs, related to the graph's end-structure. Using a combinatorial theorem of…

We consider the graphical mean curvature flow of maps ${\bf f}:\mathbb{R}^m\to\mathbb{R}^n$, $m\ge 2$, and derive estimates on the growth rates of the evolved graphs, based on a new version of the maximum principle for properly immersed…

Real-world data is often represented through the relationships between data samples, forming a graph structure. In many applications, it is necessary to learn this graph structure from the observed data. Current graph learning research has…

Over the last two decades, it has been argued that the Lorentz transformation mechanism, which imposes the generalization of Newton's classical mechanics into Einstein's special relativity, implies a generalization, or deformation, of the…

Recently, Choi and Park introduced an invariant of a finite simple graph, called signed a-number, arising from computing certain topological invariants of some specific kinds of real toric manifolds. They also found the signed a-numbers of…

We show some level-2 large deviation principles for rational maps satisfying a strong form of non-uniform hyperbolicity, called "Topological Collet-Eckmann". More precisely, we prove a large deviation principle for the distribution of…

We introduce a mapping between graphs and pure quantum bipartite states and show that the associated entanglement entropy conveys non-trivial information about the structure of the graph. Our primary goal is to investigate the family of…

A \emph{$k$--bisection} of a bridgeless cubic graph $G$ is a $2$--colouring of its vertex set such that the colour classes have the same cardinality and all connected components in the two subgraphs induced by the colour classes have order…

Graphs constructed to translate some graph problem into another graph problem are usually called auxiliary graphs. Specifically total graphs of simple graphs are used to translate the total colouring problem of the original graph into a…

Kirchhoff's Matrix-Tree Theorem asserts that the number of spanning trees in a finite graph can be computed from the determinant of any of its reduced Laplacian matrices. In many cases, even for well-studied families of graphs, this can be…

The eigenvalues of the normalized Laplacian of a graph provide information on its topological and structural characteristics and also on some relevant dynamical aspects, specifically in relation to random walks. In this paper we determine…