A kind of conditional vertex connectivity of Cayley graphs generated by 2-trees-Reference-Cited by-同舟云学术

A kind of conditional vertex connectivity of Cayley graphs generated by 2-trees

Published:2011-10 Issue:19 Volume:181 Page:4300-4308
ISSN:0020-0255
Container-title:Information Sciences
language:en
Short-container-title:Information Sciences

Author:

Cheng Eddie,Lipták László,Yang Weihua,Zhang Zhao,Guo Xiaofeng

Publisher

Elsevier BV

Subject

Artificial Intelligence,Information Systems and Management,Computer Science Applications,Theoretical Computer Science,Control and Systems Engineering,Software

Reference39 articles.

1. S.B. Akers, D. Harel, B. Krishnamurthy, The star graph: An attractive alternative to the n-cube, in: Proceedings of International Conference on Parallel Processing, 1987, pp. 393–400.

2. Hyper hamiltonian laceability of Cayley graphs generated by transpositions;Araki;Networks,2006

3. A survey of integrity;Bagga;Discrete Applied Mathematics,1992

4. Toughness in graphsa survey;Bauer;Graphs and Combinatorics,2006

5. The number of labeled k-dimensional trees;Beineke;Journal of Combinatorial Theory,1969

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

1. The g-faulty-block connectivity of folded hypercubes;The Journal of Supercomputing;2024-02-15

2. The Component (Edge) Connectivity of Round Matching Composition Networks;International Journal of Foundations of Computer Science;2022-05-28

3. Generalized (edge-)connectivity of join, corona and cluster graphs;AIMS Mathematics;2022

4. The h-restricted connectivity of balanced hypercubes;Discrete Applied Mathematics;2021-12

5. The h-Restricted Connectivity of a Class of Hypercube-Based Compound Networks;The Computer Journal;2021-07-30