相关论文: 2-regular Digraphs of the Lovelock Lagrangian

Let $\mathbb{S}_g$ be the orientable surface of genus $g$. We show that the number of vertex-labelled cubic multigraphs embeddable on $\mathbb{S}_g$ with $2n$ vertices is asymptotically $c_g n^{5(g-1)/2-1}\gamma^{2n}(2n)!$, where $\gamma$…

The well-known 1-2-3 Conjecture asserts that the edges of every graph without isolated edges can be weighted with $1$, $2$ and $3$ so that adjacent vertices receive distinct weighted degrees. This is open in general. We prove that every…

We define 2-decompositions of ribbon graphs, which generalise 2-sums and tensor products of graphs. We give formulae for the Bollobas-Riordan polynomial of such a 2-decomposition, and derive the classical Brylawski formula for the Tutte…

In this paper we enumerate $k$-noncrossing tangled-diagrams. A tangled-diagram is a labeled graph whose vertices are $1,...,n$ have degree $\le 2$, and are arranged in increasing order in a horizontal line. Its arcs are drawn in the upper…

This study is the $2^{nd}$ part of a detailed study on Type-2 isomorphic circulant graphs having ten parts \cite{v2-1}-\cite{v2-10}. Definition of Type-2 isomorphism of circulant graphs $C_n(R)$ w.r.t. $m$ was further modified by the author…

In a series of three papers we develop an end space theory for directed graphs. As for undirected graphs, the ends of a digraph are points at infinity to which its rays converge. Unlike for undirected graphs, some ends are joined by limit…

Of four types of Kaplansky algebras, type-2 and type-4 algebras have previously unobserved $\mathbb{Z}/2$-gradings: nonlinear in roots. A method assigning a simple Lie superalgebra to every $\mathbb{Z}/2$-graded simple Lie algebra in…

In the continuum, a topological obstruction to the vanishing of the non-abelian anomaly in 2n dimensions is given by the index of a certain Dirac operator in 2n+2 dimensions, or equivalently, the index of a 2-parameter family of Dirac…

Lagrangian embeddings $\mathrm{S}^1\times\mathrm{S}^{n-1}\hookrightarrow\mathbb{R}^{2n}$ are classified up to smooth isotopy for all $n\ge 3$.

We unify several seemingly different graph and digraph classes under one umbrella. These classes are all broadly speaking different generalizations of interval graphs, and include, in addition to interval graphs, also adjusted interval…

We generalise theorems of Cochran-Lickorish and Owens-Strle to the case of links with more than one component. This enables the use of linking forms on double branched covers, Heegaard Floer correction terms, and Donaldson's diagonalisation…

We give two combinatorial proofs of the fact that the number of loopless digraphs on the vertex set $[n]$ with no isolated vertices and with exactly one Eulerian tour up to a cyclic shift is $\frac{1}{2}(n-1)!C_{n}$, where $C_{n}$ denotes…

From a generalization to $Z^n$ of the concept of congruence we define a family of regular digraphs or graphs called multidimensional circulants, which turn out to be Cayley (di)graphs of Abelian groups. This paper is mainly devoted to show…

The branched deformations of immersed compact special Lagrangian submanifolds are studied in this paper. If there exists a nondegenerate $\mathbb{Z}_2$ harmonic 1-form over a special Lagrangian submanifold $L$, we construct a family of…

A general expression is given for the quartic Lovelock tensor in terms of the Riemann-Christoffel and Ricci curvature tensors and the Riemann curvature scalar for n-dimensional differentiable manifolds having a general linear connection. In…

We characterize the graphs with loops whose degree sequences have no repeated values and find their adjacency spectrum. In the case of simple graphs, such graphs are called anti-regular graphs and are examples of threshold graphs. The…

An important topic in the design of efficient networks is the construction of $(d,k,+\epsilon )$-digraphs, i.e. $k$-geodetic digraphs with minimum out-degree $\geq d$ and order $M(d,k)+ \epsilon $, where $M(d,k)$ represents the Moore bound…

Entanglement is a complexity measure of digraphs that origins in fixed-point logics. Its combinatorial purpose is to measure the nested depth of cycles in digraphs. We address the problem of characterizing the structure of graphs of…

We characterize those graphs which correspond to a rigid 2-step nilpotent Lie algebra in the variety of at most 2-step nilpotent Lie algebras.

In this paper, we prove that all but one of the components of the transfer digraph ${\cal D}^*_m$ needed for the enumeration of 2-factors in the rectangular, thick cylinder and Moebius strip grid graphs of the fixed width $m$ $(m \in N)$…