The k-degree Cayley graph and its topological properties

被引：17

作者：

Hsieh, SY ^{[1
]}

Hsiao, TT ^{[1
]}

机构：

[1] Natl Cheng Kung Univ, Dept Comp Sci & Informat Engn, Tainan 701, Taiwan

来源：

NETWORKS | 2006年 / 47卷 / 01期

关键词：

graph-theoretic interconnection networks; network topology; topological properties; embedding; shortest path routing algorithm;

D O I：

10.1002/net.20096

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

This article introduces a new family of Cayley graphs, called k-degree Cayley graphs, for building interconnection networks. The k-degree Cayley graph possesses many valuable topological properties, such as regularity with degree k, logarithmic diameter, and maximal fault tolerance. We present an optimal shortest path routing algorithm for the k-degree Cayley graph. Cycle-embedding and clique-embedding are also discussed. (c) 2005 Wiley Periodicals, Inc.

引用

页码：26 / 36

页数：11

共 50 条

[21] THE MINIMUM ORDER OF A CAYLEY GRAPH WITH GIVEN DEGREE AND DIAMETER
HAMIDOUNE, YO
NETWORKS, 1993, 23 (04) : 283 - 287
[22] Privacy preservation method based on k-degree anonymity in social networks
Gong W.-H.
Lan X.-F.
Pei X.-B.
Yang L.-H.
Tien Tzu Hsueh Pao/Acta Electronica Sinica, 2016, 44 (06): : 1437 - 1444
[23] KCPMA: k-degree Contact Pattern Mining Algorithms for Moving Objects
Chen, You
Dai, Hua
Jiang, Mingfeng
Lu, Qu
Li, Pengyue
Li, Bohan
Yang, Geng
PROCEEDINGS OF THE 2024 27 TH INTERNATIONAL CONFERENCE ON COMPUTER SUPPORTED COOPERATIVE WORK IN DESIGN, CSCWD 2024, 2024, : 2764 - 2769
[24] Properties of the Involutory Cayley graph of (Zn, ⊕, ⊙)
Anusha, M. Venkata
Parvathi, M. Siva
INTERNATIONAL CONFERENCE ON MATHEMATICAL SCIENCES AND APPLICATIONS (ICMSA-2019), 2020, 2246
[25] TSRAM: A time-saving k-degree anonymization method in social network
Kiabod, Maryam
Dehkordi, Mohammad Naderi
Barekatain, Behrang
EXPERT SYSTEMS WITH APPLICATIONS, 2019, 125 : 378 - 396
[26] k-Degree Parallel Comparison-Free Hardware Sorter for Complete Sorting
Ray, Sanchita Saha
Ghosh, Surajeet
IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 2023, 42 (05) : 1438 - 1449
[27] k-Degree anonymity and edge selection: improving data utility in large networks
Jordi Casas-Roma
Jordi Herrera-Joancomartí
Vicenç Torra
Knowledge and Information Systems, 2017, 50 : 447 - 474
[28] RL-KDA: A K-degree Anonymity Algorithm Based on Reinforcement Learning
Ma, Xuebin
Xiang, Nan
Gao, Yulan
2023 IEEE 47TH ANNUAL COMPUTERS, SOFTWARE, AND APPLICATIONS CONFERENCE, COMPSAC, 2023, : 729 - 734
[29] Model for protection of k-degree anonymity privacy under neighbor subgraph disturbance
Ding H.
Tang M.
Liu H.
Jiang H.
Fu P.
Yu Y.
Xi'an Dianzi Keji Daxue Xuebao/Journal of Xidian University, 2023, 50 (04): : 180 - 193
[30] k-Degree anonymity and edge selection: improving data utility in large networks
Casas-Roma, Jordi
Herrera-Joancomarti, Jordi
Torra, Vicenc
KNOWLEDGE AND INFORMATION SYSTEMS, 2017, 50 (02) : 447 - 474

← 1 2 3 4 5 →