相关论文: A new class of reconstructible graphs

In this note we introduce a new technique to answer an issue posed in [7] concerning geometric properties of the set of non-surjective linear operators. We also extend and improve a related result from the same paper.

We obtain a complete description of the planar cubic Cayley graphs, providing an explicit presentation and embedding for each of them. This turns out to be a rich class, comprising several infinite families. We obtain counterexamples to…

In this paper, we construct additively graceful signed graphs S from a given graph G that may be additively graceful or not be additively graceful. We also show the construction of additively graceful signed graphs from additively graceful…

This paper proposes an autoregressive (AR) model for sequences of graphs, which generalises traditional AR models. A first novelty consists in formalising the AR model for a very general family of graphs, characterised by a variable…

In this paper, we classify reflexible regular Cayley maps for dihedral groups.

This article introduces a new approach to discrete curvature based on the concept of effective resistances. We propose a curvature on the nodes and links of a graph and present the evidence for their interpretation as a curvature. Notably,…

In this paper we give two characterisations of the class of reflexive graphs admitting distributive lattice polymorphisms and use these characterisations to address the problem of recognition: for a reflexive graph G in which no two…

The concept of n-categories and related subject is considered. An n-category is described as an n-graph with a composition. A new definition of operad is presented. Some illustrative examples are given.

We propose an approach to learning with graph-structured data in the problem domain of graph classification. In particular, we present a novel type of readout operation to aggregate node features into a graph-level representation. To this…

In this note, we give an alternative construction of the $G_2(2)$-graph from a $U_3(2)$-geometry.

We provide new families of minimal codes in any characteristic. Also, an inductive construction of minimal codes is presented.

Characterizing derived equivalences between algebras via combinatorial structures has recently become a popular topic. In this paper, we study admissible fractional Brauer graph algebras, a new subclass of self-injective special biserial…

In this paper we introduce a superclass of split digraphs, which we call spine digraphs. Those are the digraphs D whose vertex set can be partitioned into two sets X and Y such that the subdigraph induced by X is traceable and Y is a stable…

In this paper we present many congruences for several Ap\'ery-like sequences.

We introduce a class of random graphs that we argue meets many of the desiderata one would demand of a model to serve as the foundation for a statistical analysis of real-world networks. The class of random graphs is defined by a…

In this article, the author proposes a new approach for the estimating of the number of edges in induced subgraphs of a special distance graph. Author significantly improves previous estimates and suggests a new approach to obtaining better…

In a prior work, the galaxies of the nonstandard enlargements of conventionally infinite graphs and also of transfinite graphs of the first rank of transfiniteness were defined, examined, and illustrated by some examples. In this work it is…

We describe constructions of infinite graphs which are not representable as integral graphs in the plane, addressing a question of Erd\H{o}s. We also mention some related problems.

We exhibit some new families of cyclotomic fields which have non-trivial plus parts of their class numbers. We also prove the $3$ - divisibility of the plus part of the class number of another family consisting of infinitely many cyclotomic…

In these lectures I discuss Feynman graphs and the associated Feynman integrals. Of particular interest are the classes functions, which appear in the evaluation of Feynman integrals. The most prominent class of functions is given by…