理学 >>> 数学 >>> 数理逻辑与数学基础 数论 代数学 代数几何学 几何学 拓扑学 数学分析 非标准分析 函数论 常微分方程 偏微分方程 动力系统 积分方程 泛函分析 计算数学 概率论 数理统计学 应用统计数学 运筹学 组合数学 离散数学 模糊数学 应用数学 数学其他学科
搜索结果: 1-15 共查到数学 graphs相关记录256条 . 查询时间(0.078 秒)
Turán-type problem may be one of central problems in extremal graph theory. Particularly, the Turán number of a cycle attracts much attention. In this talk, we introduce a terminology, that is, theta ...
Cayley graphs form an important class of vertex-transitive graphs, which have been the object of study for many decades. These graphs admit a group of automorphisms that acts regularly (sharply-transi...
Nowadays "colored notions of connectivity in graphs" becomes a new and active subject in graph theory. Starting from rainbow connection, monochromatic connection and proper connection appeared later. ...
Curvature is a notion originally developed in differential and Riemannian geometry. It was then discovered that curvature inequalities in Riemannian manifolds are equivalent to other geometric propert...
Graphical models are popular statistical tools which are used to represent dependent or causal complex systems. Statistically equivalent causal or directed graphical models are said to belong to a Mar...
The orientation preserving topological symmetry group of a graph embedded in the 3-sphere is the subgroup of the automorphism group of the graph consisting of those automorphisms which can be induc...
We prove that for every closed, connected, orientable, irreducible 3-manifold, there exists an alternating group An which is not the topological symmetry group of any graph embedded in the manifold. ...
We present an adaptive finite element method (AFEM) of any polynomial degree for the Laplace-Beltrami operator on C 1 graphs Γ in R d (d ≥ 2). We first derive residual-type a posteri...
We develop a new approach to formulate and prove the weak uncertainty inequality which was recently introduced by Okoudjou and Strichartz.We assume either an appropriate measure growth condition with ...
Given a sequence {αn} in (0, 1) converging to a rational, we examine the model theoretic properties of structures obtained as limits of ShelahSpencer graphs G(m, m−αn ). We show that in most c...
A spanning tree T in a finite planar connected graph G determines a dual spanning tree T* in the dual graph G* such that T and T* do not intersect. We show that it is not always possible to find T in ...
We show that for integers k > 1 and n > 2, the diameter of the Cayley graph of SLn(Z/kZ) with respect to a standard two-element generating set, is at most a constant times n2 ln k. This answers a ques...
We give a non-deterministic algorithm that expresses elements of SLN(Z), for N>2, as words in a finite set of generators, with the length of these words at most a constant times the word metric. We sh...
We pose some graph theoretic conjectures about duality and the diameter of maximal trees in planar graphs, and we describe innovations in the following two topics in Geometric Group Theory, where the ...
Consider a collection of random variables attached to the vertices of a graph. The reconstruction problem requires to estimate one of them given ‘far away’ observations. Several theoretical results (a...

中国研究生教育排行榜-

正在加载...

中国学术期刊排行榜-

正在加载...

世界大学科研机构排行榜-

正在加载...

中国大学排行榜-

正在加载...

人 物-

正在加载...

课 件-

正在加载...

视听资料-

正在加载...

研招资料 -

正在加载...

知识要闻-

正在加载...

国际动态-

正在加载...

会议中心-

正在加载...

学术指南-

正在加载...

学术站点-

正在加载...