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

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

Optimally Connected Hybrid Complex Networks with Windmill Graphs Backbone: 《Journal of Systems Science & Complexity》2020年第4期903-929,共27页SAFAEI Farshad BABAEI Amin MOUDI Mehrnaz; The significance of the existing analysis methods in complex networks and easy access to the ever-increasing volume of information present the emergence of proposing new methods in various fields based on complex syst...; 关键词：effect. utilizing OPTIMAL

A NOTE ON CONNECTED FACTORS IN CLAW-FREE GRAPHS被引量：2: 《Journal of Systems Science & Complexity》2001年第1期91-92,共2页XU Baoguang, LIU Zhenhong (Institute of Systems Science, Chinese Academy of Sciences, Beijing 100080, China); the National Natural Science Foundation of China.; In this paper it is shown that every connected claw-free graph G contains connected [a, max{a + 2, b}]-factors if it has [a, b]-factors, where a, b are integers and b ≥ a ≥ 1.; 关键词：CONNECTED FACTOR CLAW-FREE GRAPH [f g]-factor.

CONNECTED [1, k]-FACTORS OF BALANCE BIPARTITE GRAPHS: 《Systems Science and Mathematical Sciences》1999年第2期149-153,共5页XU Rui(Department of Mathematics, Shandong University, Jinan 250100, China); In this paper, a sufficient condition for a balance bipartite graph to have a connected [1, k]-factor is given, which generalizes a known condition of a balance bipartite graph for the existence of a hamilton-path.; 关键词：GRAPH BALANCE BIPARTITE GRAPH DEGREE CONNECTED factor.

PATH EXTENSIBILITY OF CONNECTED,LOCALLY 2-CONNECTED K_(1,3)-FREE GRAPHS被引量：2: 《Systems Science and Mathematical Sciences》1997年第3期267-274,共8页WANG Jianglu(Department of Mathematics, Shandong Teachers’ University, Ji’nan 250014, China)ZHU Yongjin(Institute of Systems Science, Academia Sinica, Beijing 100080, China); In this paper, we prove that every connected, locally 2-connected claw-freegraph is path extendable.; 关键词：CLAW-FREE graph LOCALLY k-connected PATH extendable.

LONGEST CYCLES IN 2-CONNECTEDCLAW-FREE GRAPHS: 《Systems Science and Mathematical Sciences》1997年第2期176-182,共7页GAO Taiping (Department of Mathematics, University of Shanxi, Taiyuan 030006, China) LI Hao (L. R. I., URA 410 C.N.R.S. Bat. 490, Universite de Paris-sud 91405-Orsay CEDEX, France)WEI Bing (Institute of System Science, Academia Sinica, Beijing 100080, Chi; M. Matthews and D. Sumner proved that if G is a 2-connected claw-free graph of order n, then c(G) min{2δb + 4, n}. In this paper, we prove that if G is a,2-connected claw-free graph on n venices, then c(G) min{3δ + ...; 关键词：CONNECTED garph 2-connected CLAW-FREE GRAPH CYCLE longest cycle.

A LOCALIZATION CONDITION FORBIPANCYCLIC BIPARTITE GRAPHS: 《Systems Science and Mathematical Sciences》1997年第1期61-65,共5页SHI Ronghua (Department of Applied Mathematics, Naming University of Science and Technology,Nanjing 210094, China)LOU Dingjun (Department of Computer Science, Zhongshan University, Guangzhou 510275, China); In this paper we prove the following: Let G be connected balanced bipartite graph of order 2n> 4. If G satisfies the localization condition |NZ(u)\N(v)| + 2 < d(u), for any u,v∈ V(G) and d(u, v) = 3 where N(u) = {w|w...; 关键词：Localization CONDITION CONNECTED BALANCED BIPARTITE GRAPH bipancyclic ISOMORPHIC

HAMILTONICITY IN 2-CONNECTED {K_(1,3) F}-FREE GRAPHS: 《Systems Science and Mathematical Sciences》1996年第4期295-305,共11页LI Guojun LIU Zhenhong; This research is supported by the National Natural Science Foundation of China.; Let F be a graph consisting of a triangle with a pendant leaf dangling from each vertex.A graph is{K_(1,3),F}-free if it contains no induced subgraph isomorphic to K_(1,3)or F.We give a stronger structural characteris...; 关键词：{K_(1 3) F}-free graph Hamilton connected vertex dominating cycle.

A CONNECTED GRAPH IS PATH-POSITIVE IFF ITS SPECTRAL RADIUS IS AT LEAST TWO: 《Systems Science and Mathematical Sciences》1996年第4期319-325,共7页SHI Ronghua(Department of Applied Mathematics, Nanjing University of Science and Technology,Nanjing 210014, China); ＡＣＯＮＮＥＣＴＥＤＧＲＡＰＨＩＳＰＡＴＨ－ＰＯＳＩＴＩＶＥＩＦＦＩＴＳＳＰＥＣＴＲＡＬＲＡＤＩＵＳＩＳＡＴＬＥＡＳＴＴＷＯ￥ＳＨＩＲｏｎｇｈｕａ（ＤｅｐａｒｔｍｅｎｔｏｆＡｐｐｌｉｅｄＭａｔｈｅｍａｔｉｃｓ，Ｎａｎ...; 关键词：Matrix CONNECTED graph characteristic POLYNOMIAL spectral radius.

PANCONNECTIVITY AND 2-CONNECTED CLAW-FREE GRAPHS: 《Systems Science and Mathematical Sciences》1996年第1期5-12,共8页GAO Jingzhen(Department of Mathematics, Shaddock Normal University, Jinan 250014,China)ZHU Yongjin(Institute of Systems Science, Academia Sinica, Beijing 100080,China); ＰＡＮＣＯＮＮＥＣＴＩＶＩＴＹＡＮＤ２－ＣＯＮＮＥＣＴＥＤＣＬＡＷ－ＦＲＥＥＧＲＡＰＨＳ￥ＧＡＯＪｉｎｇｚｈｅｎ（ＤｅｐａｒｔｍｅｎｔｏｆＭａｔｈｅｍａｔｉｃｓ，ＳｈａｄｄｏｃｋＮｏｒｍａｌＵｎｉｖｅｒｓｉｔｙ，Ｊｉ...; 关键词：CLAW-FREE GRAPHS LENGTH of PATH panconnectivity.

A DEGREE CONDITION FOR THE EXISTENCE OF CONNECTED [k, k + 1]-FACTORS被引量：1: 《Systems Science and Mathematical Sciences》1995年第4期364-368,共5页CAI Maocheng (Institute of Systems Science, Academia Sinica,Beijing 100080, China); ＡＤＥＧＲＥＥＣＯＮＤＩＴＩＯＮＦＯＲＴＨＥＥＸＩＳＴＥＮＣＥＯＦＣＯＮＮＥＣＴＥＤ［ｋ，ｋ＋１］－ＦＡＣＴＯＲＳＡＤＥＧＲＥＥＣＯＮＤＩＴＩＯＮＦＯＲＴＨＥＥＸＩＳＴＥＮＣＥＯＦＣＯＮＮＥＣＴＥＤ［ｋ，ｋ＋１］－Ｆ...; 关键词：CONNECTED FACTOR MATCHING graph.

CONNECTED