In this paper,minimum diameter orientations of strong products of two paths are given.
文章给出了两条路强乘积的最小直径定向。
The cover pebbling number for lexicographic product graphs and some strong product graphs were determined.
解决了字典乘积图和一些强乘积图的覆盖数问题,并给出了任意一个图的关键点与直径的两个端点之间的关系。
Connectivity and edge-connectivity of strong product graphs;
强乘积图的连通度和边连通度(英文)
Connectivity of strong product graphs;
强乘积图的连通度(英文)
本站部份资料来自网络或由网友提供,如有问题请速与我们联系,我们将立即处理!
Copyright © 2013-2024 杭州优配网络科技有限公司 All Rights Reserved 浙ICP备20019715号
免责声明:本站非营利性站点,以方便网友为主,仅供学习。合作/投诉联系QQ:1553292129