云南高校图书馆联盟文献共享服务平台- CONNECTED

CONNECTED: 作品数：779被引量：921H指数：13; 导出分析报告; 相关领域：理学更多>>; 相关作者：杨波邢璐王炜李烨王昊更多>>; 相关机构：北京航天发射技术研究所上海交通大学中国科学院数学与系统科学研究院上海师范大学更多>>; 相关期刊：更多>>; 相关基金：国家自然科学基金国家重点基础研究发展计划中国博士后科学基金北京市自然科学基金更多>>

A note on hypertournaments被引量：1: 《Chinese Science Bulletin》1999年第16期1460-1463,共4页Linqiang Pan Guofei Zhou Kemin Zhang; It is proved that for given integer k≥2, almost all k-hypertournaments are strong and in almost all k-hypertournaments, every pair of vertices lies on a 3-cycle.; 关键词：TOURNAMENT hyper-tournament cycle STRONGLY CONNECTED digraph.

Some Localization Hamiltonian Conditions: 《Chinese Science Bulletin》1993年第18期1583-1584,共2页施容华; Let G be a connected graph, SV(G) and u∈V(G). Write N(S)={v∈V(G)\S: there exists a vertex w∈S such that vw∈E(G)}, N(u)={v∈V(G):uv∈E(G)}, which are respectively called the neighborhood of S and u. Let (u)=N(u)∪{...; 关键词：NEIGHBORHOOD CONNECTED VERTEX HAMILTONIAN SUBGRAPH satisfying CONJECTURE 容华五石二万

A k-HAMILTON-NICE SEQUENCE: 《Chinese Science Bulletin》1992年第18期1583-1583,共1页刘一平田丰吴正声; Project supported by the National Natural Science Foundation of China.; Let G be an undirected simple graph, t be a positive integer. Write; Y is an independent set of G, |Y|=t}. For Y∈I_t(G), i∈{0, 0, …, t}, set S_i(Y):={v∈V(G); |N(v)∩Y|=i}, s_i(Y):=|S_i(Y)|. In 1990, Chen Guan-tao ...; 关键词：undirected INTEGER CONNECTED stated RATIONAL

PANCONNECTIVITY ON 2-CONNECTED CLAW-FREE GRAPHS: 《Chinese Science Bulletin》1992年第3期253-254,共2页高敬振朱永津; A graph G is called claw-flee if G contains no induced subgraph isomorphic to K_1,3,Line graphs, an important class of graphs, are claw-free graphs. Existing results indicate that in comparison with graphs i...; 关键词：SUBGRAPH ISOMORPHIC HAMILTONIAN VERTEX moreover stronger

2-EXTENDABILITY OF GENERALIZED PETERSEN GRAPHS~*: 《Chinese Science Bulletin》1991年第20期1758-1758,共1页孙良; Project supported by the National Natural Science Foundation of China; Definition 1. If any two non-adjacent edges of a connected graph G can be extended to a 1-factor of G, then G is said to be 2-extendable. Definition 2. Let k and n be integers with 1≤k≤n/2. A graph G=（V, E） is sai...; 关键词：Petersen INTEGERS CONNECTED 定阳 ARITHMETIC 心阴 settle

LOWER BOUND OF CONNECTIVITY IN CIRCULAR GRAPHS: 《Chinese Science Bulletin》1991年第18期1579-1579,共1页周永生李唐芬; Let D denote a diconnected digraph and D(n, S)denote a connected circular digraph.Suppose CV(D). If D-C is not a diconnected digraph or is a single vertex, then C is called vertex cutset of D. We denote all vertex out...; 关键词：VERTEX CONNECTED CIRCULAR

SOME RESULTS ON THE QU OF OPERATORS: 《Chinese Science Bulletin》1991年第5期362-365,共4页严子锟; B. Sz-Nagy and C. Foias introduced the concept of quasisimilarity in 1967. Since then, the quasisimilarity of operators has become an important research problem in the theory of operators and a lot of attractive resul...; 关键词：BOUNDED linear OPERATOR QUASISIMILARITY CONNECTED component of spectrum.

THE AVERAGE DISTANCE OF A CONNECTED GRAPH: 《Chinese Science Bulletin》1991年第4期348-348,共1页施容华; Project supported by the National Natural Science Foundation of China.; The diameter D(G) and the average distance of a graph G are D(G)= {d_G(u, v)|u≠v, u, v∈V(G)} and which are interesting graph-theoretical invariants in their own right, and they play significant roles in analyzing co...; 关键词：INVARIANTS CONNECTED LETTER 二凡召刀

NEW SUFFICIENT CONDITIONS OF THE LONGEST CYCLES OF 1-TOUGH GRAPHS: 《Chinese Science Bulletin》1991年第3期261-262,共2页田永成; In this letter all graphs will be finite, undirected simple graphs. Let G be a graph. We shall use V(G), E and c(G) to denote the vertex set, the edge set and the circumference of G respectively. We denote the distanc...; 关键词：undirected VERTEX LETTER CONNECTED CIRCUMFERENCE 孟玉孟之公之

ON THE EDGE-DISJOINT 1-FACTORS IN THE POWER OF CONNECTED GRAPHS: 《Chinese Science Bulletin》1990年第21期1841-1841,共1页张建勋; Let G = ( V, E ) be a simple connected graph of order p, and n be a positive integer. The nth power G^n of G is defined as: V(G)= V(G^n), E(G^n)={uv: u, v ∈ V(G), d_G(u, v)≤n},where d_G,(u, v )is the distance betwee...; 关键词：INTEGER CONNECTED DISJOINT

CONNECTED