文章基本信息

标题：A connected graph with non-concurrent Longest Cycles
本地全文：下载
作者：Abdul Hameed Junejo ; Abdul Naem Kalhoro ; Inayatullah soomro 等
期刊名称：International Journal of Computer Science and Network Security
印刷版ISSN：1738-7906
出版年度：2019
卷号：19
期号：5
页码：78-80
出版社：International Journal of Computer Science and Network Security
摘要：The various researchers have introduced graphs with Gallia’s property avoiding longest paths by each of its vertices. However in this Contribution, a graph is introduced with the property that each vertex is missed by some longest Cycles. The introduced graphs with Gallia’s property have potential applications in the fields of computational geometry, networking and circuit designing.
关键词：C_i^j;C ?_i^j; P_i^j Hamiltonian cycle;longest cycle;Hypo-traceable;Hypo-Hamiltonian;Gallai’s property