相关论文: The edge-isorperimetric problem on Sierpinski grap…

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. The forcing conjecture further strengthens this, claiming that any…

We give a characterization of isomorphisms between Schreier graphs in terms of the groups, subgroups and generating systems. This characterization may be thought as a graph analog of Mostow's rigidity theorem for hyperbolic manifolds. This…

We consider the edge- and vertex-isoperimetric probem on finite and infinite hexagonal grids: For a subset W of the hexagonal grid of given cardinality, we give a lower bound for the number of edges between W and its complement, and lower…

Let $\Gamma_n$ denote the $n$-th level Sierpi\'nski graph of the Sierpi\'nski gasket $K$. We consider, for any given conductance $(a_0, b_0, c_0)$ on $\Gamma_0$, the Dirchlet form ${\mathcal E}$ on $K$ obtained from a recursive construction…

To investigate hyperbinary expansions of a nonnegative integer~$n$, an edge-labeled directed graph $A(n)$ has recently been introduced. After pointing out some new simple facts about its cyclomatic number, we give a relatively simple…

We revisit Sapozhenko's classic proof on the asymptotics of the number of independent sets in the discrete hypercube $\{0,1\}^d$ and Galvin's follow-up work on weighted independent sets. We combine Sapozhenko's graph container methods with…

Results are given from a search to form adinkra-like equations based on topologies that are not hypercubes. An alternate class of zonohedra topologies are used to construct adinkra-like graphs. In particular, the rhombic dodecahedron and…

We consider finite graphs whose vertexes are supersingular elliptic curves, possibly with level structure, and edges are isogenies. They can be applied to the study of modular forms and to isogeny based cryptography. The main result of this…

The remarkable structure and computationally explicit form of isogeny graphs of elliptic curves over a finite field has made them an important tool for computational number theorists and practitioners of elliptic curve cryptography. This…

In this paper, we show that the infinitesimal Torelli theorem implies the existence of deformations of automorphisms. In the first part, we use Hodge theory and deformation theory to study the deformations of automorphisms of complex…

We introduce a concept of isoperimetric dimension for magnetic graphs, that is, graphs where every edge is assigned a complex number of modulus one. In analogy with the classical case, we show that isoperimetric inequalities imply Sobolev…

A common problem in graph colouring seeks to decompose the edge set of a given graph into few similar and simple subgraphs, under certain divisibility conditions. In 1987 Wormald conjectured that the edges of every cubic graph on $4n$…

This paper uses the theory of covering graphs to characterize some of the edge-transitive graphs which can arise as token graphs.

In this paper, several nonlinear elliptic systems are investigated on graphs. One type of the sobolev embedding theorem and a new version of the strong maximum principle are established. Then, by using the variational method, the existence…

In this dissertation, we explore the structure of inversion graphs of permutations--a class of graphs that naturally arises by representing each permutation as a graph, where vertices correspond to entries and edges encode inversions.…

We relate the graph isomorphism problem to the solvability of certain systems of linear equations with nonnegative variables. This version replaces the two previous versions of this paper.

In this paper, first it is shown that the "FSibonacci $(p,r)$-cube"(denoted as $I\Gamma_{n}^{(p,r)}$) studied in many papers, such as \cite{OZY}, \cite{K1}, \cite{OZ}, \cite{KR} and \cite{JZ}, is a new topological structure different from…

The classification of the possible equilibrium shapes that a self-gravitating fluid can take in a Riemannian manifold is a classical problem in mathematical physics. In this paper it is proved that the equilibrium shapes are isoparametric…

Isometric class of minimal surfaces in the Euclidean 3-space $\mathbb{R}^3$ has the rigidity: if two simply connected minimal surfaces are isometric, then one of them is congruent to a surface in the specific one-parameter family, called…

We consider orbit partitions of groups of automorphisms for the symplectic graph and apply Godsil-McKay switching. As a result, we find four families of strongly regular graphs with the same parameters as the symplectic graphs, including…