摘要
本文研究了强笛卡尔积图的边联结数，求得了路与路、路与圈、圈与圈、路与完备图、圈与完备图、路与完备偶图、圈与完备偶图、完备图与完备图、完备图与完备偶图、完备偶图与完备偶图的强笛卡尔积的边联结数。
In this paper,we obtain the edge-binding number of strong cartesian products of the following graphs:path and path,path and circuit,circuit and circuit,path and complete graph,cireuit and complete graph,path and complete bipartite graph,circuit and complete bipartite graph,complete graph and complete graph,complete graph and complete bipartite graph,complete bipartite graph and complete bipartite graph.
出处
《山东矿业学院学报》
CAS
1994年第4期412-417,共6页
Journal of Shandong University of Science and Technology(Natural Science)
基金
铁道部
甘肃省自然科学基金
关键词
图
强笛卡尔积
边联结数
graphs
paths
circuits
complete graphs
bipartite graph
strong cartesian product
edge-binding number
