相关论文: Beyond Bass Collapse: New Irregular Edge-Space Inv…

Adjacency polytopes, a.k.a. symmetric edge polytopes, associated with undirected graphs have been defined and studied in several seemingly independent areas including number theory, discrete geometry, and dynamical systems. In particular,…

In this paper, we attach several new invariants to connected strongly regular graphs (excepting conference graphs on non-square number of vertices) : one invariant called the discriminant, and a p-adic invariant corresponding to each prime…

We show that if a graph $G$ has average degree $\bar d \geq 4$, then the Ihara zeta function of $G$ is edge-reconstructible. We prove some general spectral properties of the edge adjacency operator $T$: it is symmetric for an indefinite…

This paper develops an invariant--geometric interpretation of the canonization problem for simple undirected weighted graphs based on the {discrete moving frame method} for finite groups. We consider the action of the {pair group}…

The so-called Takahashi's \emph{Inversion Theorem}, the reconstruction of a given spinor based on its bilinear covariants, are re-examined, considering alternative dual structures. In contrast to the classical results, where the Dirac dual…

The scattering process on multiloop infinite p+1-valent graphs (generalized trees) is studied. These graphs are discrete spaces being quotients of the uniform tree over free acting discrete subgroups of the projective group $PGL(2, {\bf…

Let $G$ be a finite simple graph with oriented incidence matrix $D$. The signed graph on edge set $E(G)$ with adjacency matrix \[ A_{\mathcal A(G)}=D^{\mathsf T}D-2I \] is classical in the signed-line-graph literature. In this paper we…

A \emph{locally irregular graph} is a graph whose adjacent vertices have distinct degrees. We say that a graph $G$ can be decomposed into $k$ locally irregular subgraphs if its edge set may be partitioned into $k$ subsets each of which…

In [5] the structure of the bifurcation diagrams of a class of superlinear indefinite problems with a symmetric weight was ascertained, showing that they consist of a primary branch and secondary loops bifurcating from it. In [4] it has…

A doubly group-labeled graph is an oriented graph with its edges labeled by elements of the direct sum of two groups $\Gamma_1,\Gamma_2$. A cycle in a doubly group-labeled graph is $(\Gamma_1,\Gamma_2)$-non-zero if it is non-zero in both…

Given a prime number $p$, we study topological analogues of Iwasawa invariants associated to $\mathbb{Z}_p$-covers of the $3$-sphere that are branched along a link. We prove explicit criteria to detect these Iwasawa invariants, and apply…

The problem of block diagonalization for diagonally dominant symmetric block operator matrices with self-adjoint diagonal entries is considered. We show that a reasonable block diagonalization with respect to a reducing graph subspace…

It is known that the generating function associated with the enumeration of non-backtracking walks on finite graphs is a rational matrix-valued function of the parameter; such function is also closely related to graph-theoretical results…

The attractive inverse square potential arises in a number of physical problems such as a dipole interacting with a charged wire, the Efimov effect, the Calgero-Sutherland model, near-horizon black hole physics and the optics of Maxwell…

In this paper we present a novel approach in extremal set theory which may be viewed as an asymmetric version of Katona's permutation method. We use it to find more Tur\'an numbers of hypergraphs in the Erd\H{o}s--Ko--Rado range. An…

Symmetry breaking for graphs and other combinatorial objects is notoriously hard. On the one hand, complete symmetry breaks are exponential in size. On the other hand, current, state-of-the-art, partial symmetry breaks are often considered…

Let G=SU(2) and let \Omega G denote the space of continuous based loops in G, equipped with the pointwise conjugation action of G. It is a classical fact in topology that the ordinary cohomology H^*(\Omega G) is a divided polynomial algebra…

The 1-2-3 Conjecture, introduced by Karo\'nski, {\L}uczak, and Thomason in 2004, was recently solved by Keusch. This implies that, for any connected graph $G$ different from $K_2$, we can turn $G$ into a locally irregular multigraph $M(G)$,…

We study the homological algebra of edge ideals of Erd\"{o}s-R\'enyi random graphs. These random graphs are generated by deleting edges of a complete graph on $n$ vertices independently of each other with probability $1-p$. We focus on some…

Line graphs are an alternative representation of graphs where each vertex of the original (root) graph becomes an edge. However not all graphs have a corresponding root graph, hence the transformation from graphs to line graphs is not…