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

HAMILTONICITY: 作品数：23被引量：8H指数：2; 导出分析报告; 相关领域：理学自然科学总论更多>>; 相关作者：徐新萍更多>>; 相关机构：南京师范大学江苏教育学院南京大学更多>>; 相关期刊：《纯粹数学与应用数学》《Journal of Computer Science & Technology》《Acta Mathematica Sinica,English Series》《Acta Mathematicae Applicatae Sinica》更多>>; 相关基金：国家自然科学基金北京市自然科学基金山西省自然科学基金更多>>

Hamiltonicity and factor-critical of generalized Mycielskian: 《纯粹数学与应用数学》2024年第4期703-715,共13页MA Li BIAN Hong YU Haizheng LI Zhenghao; 国家自然科学基金(12361072);2023新疆维吾尔自治区自然科学基金面上项目(2023D01A36);2023新疆维吾尔自治区自然科学基金青年项目(2023D01B48);2022年新疆农业大学大学生创新项目.; In a search for triangle-free graphs with arbitrarily large chromatic number,Mycielski developed a graph transformation that transforms a graph G into a new graph(G),which is called the Mycielskian of G.A generalisati...; 关键词：Mycielskian generalized Mycielskian HAMILTONICITY MATCHING

Fault-Tolerant Hamiltonicity and Hamiltonian Connectivity of BCube with Various Faulty Elements被引量：2: 《Journal of Computer Science & Technology》2020年第5期1064-1083,共20页Gui-Juan Wang Cheng-Kuan Lin Jian-Xi Fan Jing-Ya Zhou Bao-Lei Cheng; supported by the National Natural Science Foundation of China under Grant Nos.U1905211,61572337,and 61972272;Jiangsu Planned Projects for Postdoctoral Research Funds under Grant No.1701173B;Application Foundation Research of Suzhou of China under Grant No.SYG201653;a project funded by the Priority Academic Program Development of Jiangsu Higher Education Institutions.; BCube is one kind of important data center networks.Hamiltonicity and Hamiltonian connectivity have significant applications in communication networks.So far,there have been many results concerning fault-tolerant Hami...; 关键词：data center network BCube FAULT-TOLERANCE HAMILTONICITY Hamiltonian connectivity

A Generalization of Implicit Ore-condition for Hamiltonicity of k-connected Graphs: 《Acta Mathematicae Applicatae Sinica》2020年第3期620-626,共7页Jun-qing CAI Lin WANG; supported by the National Natural Science Foundation of China (No.11501322);Scientific Research Foundation for Doctors in Qufu Normal University (No. 2012015);Natural Science Foundation of Qufu Normal University (No.xkj201415); In 2005,Flandrin et al.proved that if G is a k-connected graph of order n and V(G)=X1∪X2∪···∪Xk such that d(x)+d(y)≥n for each pair of nonadjacent vertices x,y∈Xi and each i with i=1,2,···,k,then G is hamil...; 关键词：implicit degree Hamiltonian cycle CYCLABILITY

Wiener Index, Hyper-Wiener Index, Harary Index and Hamiltonicity Properties of graphs: 《Applied Mathematics(A Journal of Chinese Universities)》2019年第2期162-172,共11页YU Gui-dong REN Li-fang LI Xing-xing; Supported by the Natural Science Foundation of China under Grant no(11871077);the NSF of Anhui Province of China under Grant no(1808085MA04);the Natural Science Foundation of Department of Education of Anhui Province of China under Grant no(KJ2017A362); In this paper, in terms of Wiener index, hyper-Wiener index and Harary index, we first give some sufficient conditions for a nearly balance bipartite graph with given minimum degree to be traceable. Secondly, we estab...; 关键词：WIENER INDEX Hyper-Wiener INDEX Harary INDEX TRACEABLE HAMILTON-CONNECTED TRACEABLE for EVERY vertex

The hamiltonicity on the competition graphs of round digraphs: 《Applied Mathematics(A Journal of Chinese Universities)》2018年第4期409-420,共12页ZHANG Xin-hong LI Rui-juan AN Xiao-ting; Supported by NSFC(11401353);TYAL of Shanxi;Natural Science Foundation of Shanxi Province(2016011005); Given a digraph D =（V, A）, the competition graph G of D, denoted by C（D）, has the same set of vertices as D and an edge between vertices x and y if and only if N;（x）∩N;（y）≠Ф. In this paper, we investigate t...; 关键词：round digraph competition graph connected component HAMILTONIAN

Degree Conditions Restricted to Induced Paths for Hamiltonicity of Claw-heavy Graphs: 《Acta Mathematica Sinica,English Series》2017年第2期301-310,共10页Bin Long LI Bo NING Sheng Gui ZHANG; Supported by NSFC(Grant No.11271300);the Natural Science Foundation of Shaanxi Province(Grant No.2016JQ1002);the Project NEXLIZ–CZ.1.07/2.3.00/30.0038; Broersma and Veldman proved that every 2-connected claw-free and P6-free graph is hamil- tonian. Chen et al. extended this result by proving every 2-connected claw-heavy and P6-free graph is hamiltonian. On the other ...; 关键词：Hamiltonian graph forbidden subgraph condition degree condition claw-heavy graph closure theory

Induced Subgraphs with Large Degrees at End-vertices for Hamiltonicity of Claw-free Graphs: 《Acta Mathematica Sinica,English Series》2016年第7期845-855,共11页Roman CADA Bin Long LI Bo NING Sheng Gui ZHANG; Supported by NSFC(Grant Nos.11271300 and 11571135);the project NEXLIZ–CZ.1.07/2.3.00/30.0038;the project P202/12/G061 of the Czech Science Foundation and by the European Regional Development Fund(ERDF);the project NTIS-New Technologies for Information Society,European Centre of Excellence,CZ.1.05/1.1.00/02.0090; A graph is called claw-free if it contains no induced subgrapn lsomorpmc to K1,3. Matthews and Sumner proved that a 2-connected claw-free graph G is Hamiltonian if every vertex of it has degree at least （[V（G）I - 2...; 关键词：Induced subgraph large degree end-vertex claw-free graph Hamiltonian graph

Four Forbidden Subgraph Pairs for Hamiltonicity of 3-connected Graphs: 《Acta Mathematicae Applicatae Sinica》2016年第2期469-476,共8页Hou-yuan LIN Zhi-quan HU; Supported by the National Natural Science Foundation of China(No.11371162 and No.11271149);A project of Shandong Province Higher Educational Science and Technology Program(No.J15LI52);Science and Technology Development Project of Shandong Province(No.2014GGX101033); For non-negative integers i,j and k, we denote the generalized net as Ni,j,k, which is a triangle with disjoint paths of length i, j and k, attached to distinct vertices of the triangle. In this paper, we prove that e...; 关键词：hamiltonian cycle forbidden subgraphs claw-free graphs CLOSURE

On hamiltonicity of 2-connected claw-free graphs被引量：2: 《Applied Mathematics(A Journal of Chinese Universities)》2012年第2期234-242,共9页TIAN Run-li XIONG Li-ming; Supported by the National Natural Science Foundation of China(11071016 and 11171129);the Beijing Natural Science Foundation(1102015); A graph G has the hourglass property if every induced hourglass S（a tree with a degree sequence 22224） contains two non-adjacent vertices which have a common neighbor in G-V（S）.For an integer k≥4,a graph G has th...; 关键词：claw-free graph HAMILTONIAN CLOSURE the hourglass property the single k-cycle property.

Hamiltonicity of 4-connected Graphs: 《Acta Mathematica Sinica,English Series》2010年第4期699-710,共12页Hao LI Feng TIAN Zhi Xia XU; Supported by NNSF of China (Grant No. 60373012);supported by NSFC (Grant No. 10601044);XJEDU2006S05; Let σk（G） denote the minimum degree sum of k independent vertices in G and α（G） denote the number of the vertices of a maximum independent set of G. In this paper we prove that if G is a 4-connected graph of ord...; 关键词：k-connected HAMILTONIAN insertible vertex crossing diagonals

高级检索 检索式检索

时间限定

期刊范围

学科限定全选

高级检索 检索式检索

时间限定

期刊范围

学科限定全选

HAMILTONICITY

检索结果分析

下载全文

高级检索检索式检索

时间限定

期刊范围

学科限定全选

高级检索 检索式检索

时间限定

期刊范围

学科限定全选

HAMILTONICITY

检索结果分析

下载全文

用户登录

高级检索检索式检索