| The number of spanning trees of a family of 2-separable weighted graphs (EI收录) | |
| Gong, Helin[1,2]; Li, Shuli[3] | |
| 刊名 | Discrete Applied Mathematics
 |
| 2017 | |
| 卷号 | 229页码:154-160 |
| 关键词 | Graphic methods |
| URL标识 | 查看原文 |
| 内容类型 | 期刊论文 |
| URI标识 | http://www.corc.org.cn/handle/1471x/2182555 |
| 专题 | 华南理工大学 |
| 作者单位 | 1.[1] Department of Fundamental Courses, Zhejiang Industry Polytechnic College, Shaoxing 2.Zhejiang 3.312000, China 4.[2] Guangxi Key Laboratory of Mathematical and Statistical Model, Guangxi Normal University, Guangxi 5.541004, China 6.[3] School of Mathematical Sciences, Xiamen University, Xiamen 7.Fujian 8.361005, China |
| 推荐引用方式 GB/T 7714 | Gong, Helin[1,2],Li, Shuli[3]. The number of spanning trees of a family of 2-separable weighted graphs (EI收录)[J]. Discrete Applied Mathematics,2017,229:154-160. |
| APA | Gong, Helin[1,2],&Li, Shuli[3].(2017).The number of spanning trees of a family of 2-separable weighted graphs (EI收录).Discrete Applied Mathematics,229,154-160. |
| MLA | Gong, Helin[1,2],et al."The number of spanning trees of a family of 2-separable weighted graphs (EI收录)".Discrete Applied Mathematics 229(2017):154-160. |
| 个性服务 |
| 查看访问统计 |
| 相关权益政策 |
| 暂无数据 |
| 收藏/分享 |
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。
修改评论