搜索结果: 1-12 共查到“信息科学与系统科学基础学科 Graphs”相关记录12条 . 查询时间(0.125 秒)
A sparse transmission disequilibrium test for haplotypes based on Bradley-Terry graphs
case-parent trio family-based study linkage
2015/8/21
Linkage and association analysis based on haplotype transmission disequilibrium can be more informative than single marker analysis. Several works have been proposed
in recent years to extend the tra...
Abstract: A sender wishes to broadcast an n character word x in F^n (for a field F) to n receivers R_1,...,R_n. Every receiver has some side information on x consisting of a subset of the characters o...
PATH EXTENSIBILITY OF CONNECTED, LOCALLY 2-CONNECTED K_{1,3}-FREE GRAPHS
Claw-free graph locally k-connected pa
2007/12/10
摘要 In this paper, we prove that every connected, locally 2-connected claw-freegraph is path extendable.
In 1990, Bondy posed the small circuit double cover (SCDC) conjecture: Every $2$-connected graph has a circuit double cover (CDC) with the number of circuits less than $|V|$ (the order of the vertex s...
An $r$-circular coloring of a graph $G$ is a map $f$ from$V(G)$ to the set of open unit intervals of an Euclidean circle oflength $r$, such that $f(u)\cap f(v)=\emptyset$ whenever $uv\inE(G)$. Circula...
THE NEIGHBORHOOD INTERSECTIONS OF ESSENTIAL SETS AND HAMILTONICITY OF GRAPHS
LTW-sequence essential sets T-vertex i
2007/8/7
n(Y) for each Y∈I^*_{k+1}(G), then G is Hamilton-connected. The existing results are generalized by these since I_{k+1}(G) is replaced by I^*_{k+1}(G). We introduce a new technique of T-insertion in t...
We show that the two distinct venices u and v of a 2-connected claw-free graph G of order n with minimun degree(n- 2)/3 are [7, n]-panconnected whenever both G-u and G-v are 2-connected.
In this paper,we consider the action of group PSL(2,P)(P≡±1(mod 8))on the set of right cosets of a maximal subgroup isomorphic to S4,and survey the nonself-paired orbitals. Then we find many infinite ...
In this paper we obtain the necessary and sufficient condition for the connec-tivity of the Cayley color graphs or the Cayley graphs to be equal to their minimum degree. The sharp lower bounds of conn...
In the paper, the (k-1)-traceable-nice ((k-1)-T-nice) and k-homogeneously-traceable-nice (k-HT-nice) sequence are defined similarly to the definition of k-Hamilton-nice (k-H-nice) and (k+1)-Hamilton-c...
Let G be a 2-edge-connected simple graph. We give a sufficient condition in which for any x,y∈V(G), there is an (x,y)-trail which contains every vertex of G(x=y is allowed)except some graphs.
Let G be the base graph with n vertices of any matroid. It is proved that for any two vertices of G there are at least r internally disjoint shortest paths joining them where r is their distance. Furt...