相关论文: Nodal domain theorem of signed hypergraphs

In this paper one finds:1) A simple combinatorical description of the distinguished boundary of the crown domain in terms of the affine Weyl group; 2) Optimal upper and lower bounds for holomorphically extended spherical functions; 3) First…

We prove improved bounds on how localized an eigenvector of a high girth regular graph can be, and present examples showing that these bounds are close to sharp. This study was initiated by Brooks and Lindenstrauss (2009) who relied on the…

Existing approaches to analyzing the asymptotics of graph Laplacians typically assume a well-behaved kernel function with smoothness assumptions. We remove the smoothness assumption and generalize the analysis of graph Laplacians to include…

We introduce a homotopy theory of digraphs (directed graphs) and prove its basic properties, including the relations to the homology theory of digraphs constructed by the authors in previous papers. In particular, we prove the homotopy…

This paper deals with some questions that have received a lot of attention since they were raised by Hejhal and Rackner in their 1992 numerical computations of Maass forms. We establish sharp upper and lower bounds for the…

Graph transformation that predicts graph transition from one mode to another is an important and common problem. Despite much progress in developing advanced graph transformation techniques in recent years, the fundamental assumption…

We extend the polydisk theorem of [21], originally established for classical Cartan-Hartogs domains, to Hartogs domains over arbitrary (possibly reducible and exceptional) bounded symmetric domains. We further establish a dual counterpart…

In this paper, we define a ternary graph operation which generalizes the construction of subdivision graph, $R-$graph, central graph. Also, it generalizes the construction of overlay graph (Marius Somodi \emph{et al.}, 2017), and…

Signed networks have been a topic of recent interest in the network control community as they allow studying antagonistic interactions in multi-agent systems. Although dynamical characteristics of signed networks have been well-studied,…

We describe a topological predual to differential forms constructed as an inductive limit of a sequence of Banach spaces. This subspace of currents has nice properties, in that Dirac chains and polyhedral chains are dense, and its operator…

A categorical formalism for directed graphs is introduced, featuring natural notions of morphisms and subgraphs, and leading to two elementary descriptions of the free-properad monad, first in terms of presheaves on elementary graphs,…

Graphs have become pervasive tools to represent information and datasets with irregular support. However, in many cases, the underlying graph is either unavailable or naively obtained, calling for more advanced methods to its estimation.…

The notion of network connectivity is used to characterize the robustness and failure tolerance of networks, with high connectivity being a desirable feature. In this paper, we develop a novel approach to the problem of identifying critical…

The generalized $k$-connectivity $\kappa_k(G)$ of a graph $G$ was introduced by Hager before 1985. As its a natural counterpart, we introduced the concept of generalized edge-connectivity $\lambda_k(G)$, recently. In this paper we summarize…

We prove a duality theorem applicable to a a wide range of specialisations, as well as to some generalisations, of tangles in graphs. It generalises the classical tangle duality theorem of Robertson and Seymour, which says that every graph…

In this paper, various kinds of invariants of directed graphs are summarized. In the first topic, the invariant w(G) for a directed graph G is introduced, which is primarily defined by S. Chen and X.M. Chen to solve a problem of weak…

Riemann surfaces with nodes can be described by introducing simple composite operators in matrix models. In the case of the Kontsevich model, it is sufficient to add the quadratic, but ``non-propagating'', term (tr[X])^2 to the Lagrangian.…

A graph $G$ is well-covered if every minimal vertex cover of $G$ is minimum, and a graph $G$ is well-dominated if every minimal dominating set of $G$ is minimum. Studies on well-covered graphs were initiated in [Plummer, JCT 1970], and…

Given feasible strongly regular graph parameters $(v,k,\lambda,\mu)$ and a non-negative integer $d$, we determine upper and lower bounds on the order of a $d$-regular induced subgraph of any strongly regular graph with parameters…

Let $E$ and $F$ be Hilbert $C^*$-modules over a $C^*$-algebra $\CAlg{A}$. New classes of (possibly unbounded) operators $t:E\to F$ are introduced and investigated. Instead of the density of the domain $\Def(t)$ we only assume that $t$ is…