On deriving explicit formulas of the surface areas for the arrangement graphs and some of the related graphs-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

On deriving explicit formulas of the surface areas for the arrangement graphs and some of the related graphs

Published:2010-10-01 Issue:13 Volume:87 Page:2903-2914
ISSN:0020-7160
Container-title:International Journal of Computer Mathematics
language:en
Short-container-title:International Journal of Computer Mathematics

Author:

Cheng Eddie¹,Qiu Ke²,Shen Zhizhang³

Affiliation:

1. Department of Mathematics and Statistics, Oakland University , Rochester, MI, 48309, USA

2. Department of Computer Science, Brock University , St. Catharines, Ontario, Canada, L2S 3A1

3. Department of Computer Science and Technology, Plymouth State University , Plymouth, NH, 03264, USA

Publisher

Informa UK Limited

Subject

Applied Mathematics,Computational Theory and Mathematics,Computer Science Applications

Link

https://www.tandfonline.com/doi/pdf/10.1080/00207160903134255

Reference24 articles.

1. A group-theoretic model for symmetric interconnection networks

2. Cheng, E. , Qiu, K. , and Shen, Z. , 2008. "A generating function approach to the surface area of some interconnection networks". Rochester, MI: Department of Mathematics and Statistics, Oakland University; 2008, Tech. Rep. 2008-03.

3. A short note on the surface area of star graphs

4. Rotator graphs: an efficient topology for point-to-point multiprocessor networks

Cited by 10 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A recurrence for the surface area of the (n,k)$$ \left(n,k\right) $$‐star graph;Concurrency and Computation: Practice and Experience;2024-02-29

2. A Recurrence for the Surface Area of the ($n, k$)-Star Graph;2022 Tenth International Symposium on Computing and Networking (CANDAR);2022-11

3. Strong Matching Preclusion of Arrangement Graphs;Journal of Interconnection Networks;2016-06

4. Length two path centered surface areas of the (n, k)-star graph;Information Sciences;2016-03

5. Deriving length two path centered surface area for the arrangement graph: a generating function approach;The Journal of Supercomputing;2014-01-28

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号京ICP备18003416号-3