Hamilton-connectivity of Interconnection Networks Modeled by a Product of Graphs-Reference-Cited by-同舟云学术

Hamilton-connectivity of Interconnection Networks Modeled by a Product of Graphs

Published:2018-07-01 Issue:2 Volume:3 Page:419-426
ISSN:2444-8656
Container-title:Applied Mathematics and Nonlinear Sciences
language:en
Short-container-title:

Author:

Liu Donglin¹,Wang Chunxiang²,Wang Shaohui³

Affiliation:

1. School of Mechanical and Electronic Engineering , Wuhan University of Technology , Wuhan , PR China

2. School of Mathematics and Statistics , Central China Normal University , 430079 , Wuhan , P.R. China

3. Department of Mathematics , Savannah State University , GA 31404 , Savannah , USA

Abstract

Abstract The product graph Gm *Gp of two given graphs Gm and Gp , defined by J.C. Bermond et al.[J Combin Theory, Series B 36(1984) 32-48] in the context of the so-called (Δ,D)-problem, is one interesting model in the design of large reliable networks. This work deals with sufficient conditions that guarantee these product graphs to be hamiltonian-connected. Moreover, we state product graphs for which provide panconnectivity of interconnection networks modeled by a product of graphs with faulty elements.

Publisher

Walter de Gruyter GmbH

Subject

Applied Mathematics,Engineering (miscellaneous),Modeling and Simulation,General Computer Science

Link

https://www.sciendo.com/pdf/10.21042/AMNS.2018.2.00032

Reference14 articles.

1. Bermond J. C. , Delorme C. , and Farhi G., Large graphs with given degree and diameter II , J Combin. Theory, Series B 36 (1984) 32-48. 10.1109/TC.1984.1676504.

2. BondyJ. A. and Murty U. S. R., Graph Theory with Applications , 5th printing, American Elsevier Publishing Co., Inc., 1976.

3. Chartrand G. and Harary F., Planar permutation graphs , Ann Inst H Poincaré Sec B 3 (1967) 433-438. http://eudml.org/doc/76875

4. D. Bauer and E. Schmeichel: On a theorem of Häggkvist and Nicoghossian, In Y. Alavi, F.R.K. Chung, R.L. Graham and D. S. Hsu, eds., Graph Theory, Combinatorics, Algorithms, and Applications-Proceedings 2nd China-USA Graph Theory Conference, SIAM(1991)20-25.

5. B. Wei, A Generalization of a result of Bauer and Schmeichel, Graphs and Combin. 9 (1993) 383-389. 10.1007/BF02988325

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

1. Cyclic connectivity index of fuzzy incidence graphs with applications in the highway system of different cities to minimize road accidents and in a network of different computers;PLOS ONE;2021-09-21

2. On Valency-Based Molecular Topological Descriptors of Subdivision Vertex-Edge Join of Three Graphs;Symmetry;2020-06-17

3. Zagreb Connection Indices of Subdivision and Semi-Total Point Operations on Graphs;Journal of Chemistry;2019-12-28

4. Multiplicative Zagreb Indices of Molecular Graphs;Journal of Chemistry;2019-12-06

5. Parameters and fractional factors in different settings;Journal of Inequalities and Applications;2019-05-28