文章基本信息

标题：A connected graph with set of empty intersection of all Longest Cycles
本地全文：下载
作者：Abdul Hameed Junejo ; Inayatullah Soomro ; Israr Ahmed 等
期刊名称：International Journal of Computer Science and Network Security
印刷版ISSN：1738-7906
出版年度：2019
卷号：19
期号：5
页码：87-89
出版社：International Journal of Computer Science and Network Security
摘要：In this study, connected graphs are provided with the property that every cycle arises by set of empty intersection. Furthermore, graph is produced with the property that each vertex is missed by some longest Cycles. The designed graphs can be applied in various fields of science and technology including computational geometry, networking and circuit designing.
关键词：C_i^j;C ?_i^jP_i^jP ?_i^jHamiltonian cycle;longest cycle;Hypo-traceable;Hypo-Hamiltonian;Gallai’s property