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 © 2022-2025 字海网 zi.yyxxoo.com All Rights Reserved 赣ICP备16001187号
字海网是专业的汉语在线工具集,提供权威的汉语字典、词典、成语、古诗词及英语词典查询服务,致力于传承和弘扬中华语言文化。合作与反馈请联系QQ:2830130449。
本站内容来源网络,如涉及版权或表述问题,请及时联系QQ:2830130449。