文章基本信息

标题：Theory and Applications of BenesNetwork in Graph Theory
本地全文：下载
作者：Karunagaran K ; P.Sumathi ; V. Nandakumar 等
期刊名称：International Journal of Innovative Research in Science, Engineering and Technology
印刷版ISSN：2347-6710
电子版ISSN：2319-8753
出版年度：2015
卷号：4
期号：5
页码：3350
DOI：10.15680/IJIRSET.2015.0405155
出版社：S&S Publications
摘要：A path partition of a graph is a collection of vertex-disjoint paths that cover all vertices of the graph. Thepath-partition problem is to find the path-partition number p(G) of a graph G, which is the minimum cardinality of apath partition of G. Obviously G has a Hamiltonian path if and only if p(G)= 1.
关键词：Graph;Path; Connected Graph;complete graph;chord of a cycle.