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

We prove that every (6k + 2l, 2k)-connected simple graph contains k rigid and l connected edge-disjoint spanning subgraphs. This implies a theorem of Jackson and Jord\'an [4] and a theorem of Jord\'an [6] on packing of rigid spanning…

In 1972 Tutte famously conjectured that every 4-edge-connected graph has a nowhere zero 3-flow; this is known to be equivalent to every 5-regular, 4-edge-connected graph having an edge orientation in which every in-degree is either 1 or 4.…

We introduce a new way to tabulate knots by representing knot diagrams using a pair of planar trees. This pair of trees have their edges labeled by integers, they have no valence 2 vertices, and they have the same number of valence 1…

We show that every cubic graph on $n$ vertices contains a spanning subgraph in which the number of vertices of each degree deviates from $\frac{n}{4}$ by at most $\frac{1}{2}$, up to three exceptions. This resolves the conjecture of Alon…

A tree containing exactly two non-pendant vertices is called a double-star. A double-star with degree sequence $(k_1+ 1, k_2+ 1, 1, \ldots, 1)$ is denoted by $S_{k_1, k_2}$. We study the edge-decomposition of regular graphs into…

Switching about a vertex in a digraph means to reverse the direction of every edge incident with that vertex. Bondy and Mercier introduced the problem of whether a digraph can be reconstructed up to isomorphism from the multiset of…

We study characteristics which might distinguish two-graphs by introducing different numerical measures on the collection of graphs on $n$ vertices. Two conjectures are stated, one using these numerical measures and the other using the deck…

We provide an explicit algorithm to calculate invariant tensors for the adjoint representation of the simple Lie algebra $sl(n)$, as well as arbitrary representation in terms of roots. We also obtain explicit formulae for the adjoint…

For a graph $G$, let $f_2(G)$ denote the largest number of vertices in a $2$-regular subgraph of $G$. We determine the minimum of $f_2(G)$ over $3$-regular $n$-vertex simple graphs $G$. To do this, we prove that every $3$-regular multigraph…

This note is on the structures of line graphs and 2-variegated graphs. We have given here solutions of some graph equations involving line graphs and 2-variegated graphs.

A general expression is given for the quintic Lovelock tensor as well as for the coefficient of the quintic Lovelock Lagrangian in terms of the Riemann-Christoffel and Ricci curvature tensors and the Riemann curvature scalar for…

The L(2, 1)-labeling of a digraph G is a function f from the node set of $G$ to the set of all nonnegative integers such that $|f(x)-f(y)| \geq 2$ if $x$ and $y$ are at distance 1, and $f(x)=f(y)$ if $x$ and $y$ are at distance 2, where the…

This study is the $4^{th}$ part of a detailed study on Type-2 isomorphic circulant graphs having ten parts \cite{v2-1}-\cite{v2-10} and is a continuation of Part 3. Here, we study Type-2 isomorphic circulant graphs of order 54 and show that…

An explicit construction of infinite sequences of strongly regular digraphs with parameter sets $((v+(2^{n+1}-4)t)2^{n-1}, k+(2^n-2)t, t, \lambda, t)$ is described. A computer program was used to find the initial digraphs. The remaining…

This is a mixture of survey article and research anouncement. We discuss Instanton Floer homology for 3 manifolds with boundary. We also discuss a categorification of the Lagrangian Floer theory using the unobstructed immersed Lagrangian…

Under certain topological assumptions, we show that two monotone Lagrangian submanifolds embedded in the standard symplectic vector space with the same monotonicity constant cannot link one another and that, individually, their smooth knot…

We introduce adequate concepts of expansion of a digraph to obtain a sequential construction of minimal strong digraphs. We characterize the class of minimal strong digraphs whose expansion preserves the property of minimality. We prove…

In this paper we show that two Lagrangian graphs over the torus in $\mathbb{C}^n$ with large Lagrangian phase can be connected via Lipschitz continuous geodesic with respect to the $L^2$ metric on the space of Lagrangian submanifolds. In…

I present an algorithm that, given a number $n \geq 1$, computes a compact representation of the set of all noncrossing acyclic digraphs with $n$ nodes. This compact representation can be used as the basis for a wide range of dynamic…

Let $G$ be a simple finite connected graph. The line graph $L(G)$ of graph $G$ is the graph whose vertices are the edges of $G$, where $ef \in E(L(G))$ when $e \cap f \neq \emptyset$. Iteratively, the higher order line graphs are defined…