搜索结果: 1-15 共查到“信息科学与系统科学 graphs”相关记录22条 . 查询时间(0.026 秒)
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...
This paper considers linear dynamic systems with an interconnection structure specified by a directed graph. We formulate linear matrix inequalities for computation of performance of the system based ...
This paper considers linear time-invariant dynamic systems with an interconnection structure specified by a directed graph. We formulate a semidefinite program for system analysis and controller synth...
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...
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 G be a connected graph of order of n, and NC2(G) denote min{|N(u) ∪ N(v)| dist(u, v) = 2}, where dist(u, v) is the distance between u and v in G. A cycle C is called a dominating cycle if every co...
摘要 Let G be a connected graph of order n, and NC2(G) denote min{|N(u)\cup (v) |: dist(u,v) = 2}, where dist(u,v) is the distance between u and v in G. A cycle C in Gis called a dominatiny cycle, if V(...
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...
A LOCALIZATION CONDITION FOR BIPANCYCLIC BIPARTITE GRAPHS
Localization condition connected balanc
2007/8/7
In this paper we prove the following: Let G be connected balanced bipartite graph of order 2n\geq 4. If G satisfies the localization condition |N_2(u)\N(v)| + 2 \leq d(u), for any u,v∈ V(G) and d(u, v...
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.
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...
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 ...
Let C be a 2-connected graph on n\geq 31 venices. G is called pancyclic if itcontains a cycle of length for every l such that 3\leq l \leq n. In this paper we shall prove that if |N(u)\cup N(v)| \geq...