Minimum Diameter Spanning Tree

Minimum Diameter Spanning Tree

下载PDF

导出

摘要 In this paper, we discuss the simple connected graphs which have a minimum diameter spanning tree such that both have same domination number. In this paper, we discuss the simple connected graphs which have a minimum diameter spanning tree such that both have same domination number.

作者 V. T. Chandrasekaran N. Rajasri

机构地区 Department of Mathematics Department of Mathematics

出处《American Journal of Computational Mathematics》 2018年第3期203-208,共6页 美国计算数学期刊（英文）

关键词 DIAMETER SPANNING Tree ESSENTIAL Dominating VERTEX PAN GRAPH Ladar GRAPH Diameter Spanning Tree Essential Dominating Vertex Pan Graph Ladar Graph

分类号 O1 [理学—数学]

引文网络
相关文献

1Zhiyong Lu,Wei Lu,Yu Zhou,Jianfeng Sun,Qian Xu,Lijuan Wang.Three-dimensional coherent ladar based on FMCW and its flight demonstration[J].Chinese Optics Letters,2019,17(9):89-94. 被引量：1
2Mohammad Reza Farahani,Wei Gao.The Schultz Index and Schultz Polynomial of the Jahangir Graphs J 5, m [J].Applied Mathematics,2015,6(14):2319-2325. 被引量：2
3Wanpeng LEI,Liming XIONG,Junfeng DU,Jun YIN.An Extension of the Win Theorem: Counting the Number of Maximum Independent Sets[J].Chinese Annals of Mathematics,Series B,2019,40(3):411-428. 被引量：1
4Xiaojing XU,Peiwen WANG,Zhiping WANG.The Normalized Laplacian Spectrum of Pentagonal Graphs and Its Applications[J].Journal of Mathematical Research with Applications,2019,39(4):343-352.
5Yingying Gao,Mohammad Reza Farahani,Muhammad Shoaib Sardar,Sohail Zafar.On the Sanskruti Index of Circumcoronene Series of Benzenoid[J].Applied Mathematics,2017,8(4):520-524.

American Journal of Computational Mathematics

2018年第3期

浏览历史

内容加载中请稍等...

Minimum Diameter Spanning Tree

相关作者

相关机构

相关主题

浏览历史