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 汉字宝典 m.suduxx.com All Rights Reserved 赣ICP备2022002761号
汉语字典 | 汉字拆字 | 汉字笔顺 | 汉语词典 | 成语词典 | 组词大全 | 近义词 | 反义词 | 造句大全 | 古诗词 | 英语单词 | 英汉词典 | 汉英字典 | 行业英语
汉字宝典是专业的汉语在线工具集,提供权威的汉语字典、词典、成语、古诗词及英语词典查询服务 | 合作联系QQ:2830130449