Author:
Krishnamoorthy M.S.,Krishnamurthy B.
Subject
Computational Mathematics,Computational Theory and Mathematics,Modeling and Simulation
Reference9 articles.
1. On the construction of (d, k) graphs;Akers;IEEE Trans. Comput.,1965
2. Hamiltonian cycles in generalized Petersen graphs;Bannai;J. Combinatorial Theory,1978
3. Counterexamples to theorems of Menger type for the diameter;Bondy;Discrete Math.,1983
4. A counterexample to a conjecture on paths of bounded length;Boyles;J. Graph Theory,1982
5. Examples and counterexamples in graph Theory;Capabianco,1978
Cited by
126 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Solving Edges Deletion Problem of Generalized Petersen Graphs;Journal of Kufa for Mathematics and Computer;2024-03-30
2. Edge-fault diameter of C4-free graphs;Discrete Mathematics;2024-01
3. The Wide Diameter of Strong Product Graphs of Complete Graphs and any Graphs;2023 IEEE 11th International Conference on Information, Communication and Networks (ICICN);2023-08-17
4. The Wide Diameter and Fault Diameter of Exchanged Crossed Cube;International Journal of Foundations of Computer Science;2023-06-23
5. Reliability measures in brother trees;Discrete Mathematics, Algorithms and Applications;2023-05-12