搜索结果: 1-12 共查到“K-Vertices”相关记录12条 . 查询时间(0.119 秒)
Equivalence Classes of Full-Dimensional 0/1-Polytopes with Many Vertices
n-cube full-dimensional 0/1-polytope symmetry hyperplane Polya theory
2014/6/3
Let Qn denote the n-dimensional hypercube with the vertex set Vn = {0, 1}n. A 0/1-polytope of Qn is a convex hull of a subset of Vn. This paper is concerned with the enumeration of equivalence classes...
Connectivity Threshold of Random Geometric Graphs with Cantor Distributed Vertices
Cantor distribution connectivity threshold random geometric graph singular distributions
2012/4/18
For connectivity of \emph{random geometric graphs}, where there is no density for underlying distribution of the vertices, we consider $n$ i.i.d. \emph{Cantor} distributed points on $[0,1]$. We show t...
Vertices of high degree in the preferential attachment tree
random graphs web graphs concentration of measure martingales
2011/2/28
We study the basic preferential attachment process, which generates a sequence of random trees, each obtained from the previous one by introducing a new vertex and joining it to one existing vertex,ch...
Period differential equations for families of $K3$ surfaces derived from 3 dimensional reflexive polytopes with 5 vertices
K3 surfaces period differential equations toric varieties
2011/1/17
In this article we study the families of K3 surfaces derived from 3 dimensional 5 verticed re-
flexive polytopes with at most terminal singularity. We determine the lattice structures, the period dif...
Space-Time Prism Vertices：Exploring Gender Differences and Multiple-Peak Distributions in Arrival and Departure Times
prism vertex stochastic frontier model space-time constraints
2010/2/1
This paper investigates gender differences in the origin and terminal vertices of the time-space prism. Using the stochastic frontier method, separate models are constructed for females and males, bas...
Vertices of given degree in a random graph。
Vertices of degree one in a random sphere of influence graph
Vertices of degree one a random sphere of influence graph
2009/9/22
The sphere of influence graph of the set of vertices in R~
is constructed by identifying the nearest neighbour of each vertex,
centering a ball at each vertex so that its nearest neighbour lies on t...
Problems For Line Labelling: A Test Set of Drawings of Objects with Higher-Valency Vertices
Line labelling K-Vertices Rotationally-Symmetric Vertices Creative Design
2009/8/19
Interpreting a natural line drawing as a solid object requires simplifying assumptions in order to make the problem more tractable. Unfortunately, some of the assumptions made in the past have overly ...
Information and Average Information Rates of a Graphical Access Structure on Six Vertices
Average Information Rates Graphical Access Structure Six Vertices
2009/7/27
In this paper we study the optimal information and average information rates of secret sharing schemes which are all connected graphs on six vertices. There are 102 connected graphs on six vertices th...
Let X~* and Y~* be generated by S\cup {v_0},where G(S)is Hamiltonian connected and|X~*|=x~*,|Y~*|=Y~* and S_1~*,S_2~*,…,S_(x*)~* be the sets of vertices contained in the opensegments of C between vert...
Let T(G) be the tree graph of a simple graph G. It is proved that if T and T′are two vertices of T(G) such that d_T(G)(T)\le d_T(G}(T′), then there ared_T(G)(T) internally disjoint paths in T(G) joini...
A note on balance vertices in trees
2007/7/28
专著信息
书名
A note on balance vertices in trees
语种
英文
撰写或编译
作者
Erfang Shan,Liying Kang
第一作者单位
出版社
Discrete Mathematics, Vol. 280, 265-269, 2004
出版地
出版日期
2004年
月
日
标准书号
介质类型
页数
字数
开本
相关项目
图的控制数理论