اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدEnumeration of irreducible contact graphs on the sphere
101
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
In this article, using the computer, are enumerated all locally-rigid packings by $N$ congruent circles (spherical caps) on the unit sphere ${Bbb S}^2 $ with $N < 12.$ This is equivalent to the enumeration of irreducible spherical contact graphs.
قيم البحث
اقرأ أيضاً
A contact graph of a packing of closed balls is a graph with balls as vertices and pairs of tangent balls as edges. We prove that the average degree of the contact graph of a packing of balls (with possibly different radii) in $mathbb{R}^3$ is not gr
eater than $13.92$. We also find new upper bounds for the average degree of contact graphs in $mathbb{R}^4$ and $mathbb{R}^5$.
In this paper we are interested in the asymptotic enumeration of Cayley graphs. It has previously been shown that almost every Cayley digraph has the smallest possible automorphism group: that is, it is a digraphical regular representation (DRR). In
this paper, we approach the corresponding question for undirected Cayley graphs. The situation is complicated by the fact that there are two infinite families of groups that do not admit any graphical regular representation (GRR). The strategy for digraphs involved analysing separately the cases where the regular group $R$ has a nontrivial proper normal subgroup $N$ with the property that the automorphism group of the digraph fixes each $N$-coset setwise, and the cases where it does not. In this paper, we deal with undirected graphs in the case where the regular group has such a nontrivial proper normal subgroup.
In this article we start a systematic study of the bi-Lipschitz geometry of lamplighter graphs. We prove that lamplighter graphs over trees bi-Lipschitzly embed into Hamming cubes with distortion at most~$6$. It follows that lamplighter graphs over c
ountable trees bi-Lipschitzly embed into $ell_1$. We study the metric behaviour of the operation of taking the lamplighter graph over the vertex-coalescence of two graphs. Based on this analysis, we provide metric characterizations of superreflexivity in terms of lamplighter graphs over star graphs or rose graphs. Finally, we show that the presence of a clique in a graph implies the presence of a Hamming cube in the lamplighter graph over it. An application is a characterization in terms of a sequence of graphs with uniformly bounded degree of the notion of trivial Bourgain-Milman-Wolfson type for arbitrary metric spaces, similar to Ostrovskiis characterization previously obtained in cite{ostrovskii:11}.
Point-determining graphs are graphs in which no two vertices have the same neighborhoods, co-point-determining graphs are those whose complements are point-determining, and bi-point-determining graphs are those both point-determining and co-point-det
ermining. Bicolored point-determining graphs are point-determining graphs whose vertices are properly colored with white and black. We use the combinatorial theory of species to enumerate these graphs as well as the connected cases.
We prove an analogue of Yaus Caccioppoli-type inequality for nonnegative subharmonic functions on graphs. We then obtain a Liouville theorem for harmonic or non-negative subharmonic functions of class Lq, 1<=q<infty, on any graph, and a quantitative
version for q > 1. Also, we provide counterexamples for Liouville theorems for 0 < q < 1.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
