default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Interconnection Networks, Volume 21
Volume 21, Number 1, March 2021
- Ankur Goyal
, Vivek Kumar Sharma, Sandeep Kumar, Ramesh Chandra Poonia:
Hybrid AODV: An Efficient Routing Protocol for Manet Using MFR and Firefly Optimization Technique. 2150004:1-2150004:18 - Gary Chartrand, Yuya Kono, Ping Zhang:
Distance Vertex Identification in Graphs. 2150005:1-2150005:15 - Simone Belli, Leonardo Reyes:
Distributing Information in Small-World Networks: Four Social Cases of the Process of Contagion in Spain. 2150008:1-2150008:14 - Monjul Saikia:
Delaunay Triangulation Based Key Distribution for Three-Dimensional Wireless Sensor Networks. 2150009:1-2150009:13
Volume 21, Number 2, June 2021
- Saeid Hanifehnezhad, Ardeshir Dolati:
Cut Star of an Undirected Graph. 2150006:1-2150006:8 - J. B. Saraf, Y. M. Borse:
A Note on Conditional Edge Connectivity of Hypercube Networks. 2150007:1-2150007:7 - Zhiwei Guo, Yaping Mao, Nan Jia, He Li:
Strong Equitable Vertex Arboricity in Cartesian Product Networks. 2150010:1-2150010:13 - Cheng Jin, Hai-Yi Zhang, Chao Wei:
The Bounds of Generalized 4-Connectivity of Alternating Group Graphs. 2150011:1-2150011:11
Volume 21, Number 3, September 2021
- P. C. Lisna, M. S. Sunitha:
b-Chromatic Sum and b-Continuity Property of Some Graphs. 2150012:1-2150012:15 - Hanxiao Qiao, Ke Wang, Suonan Renqian, Renqing Cuo:
A Note on the Multi-Colored Bipartite Ramsey Number for Paths. 2150013:1-2150013:5 - Mohamad Abdallah, Chun-Nan Hung:
Neighbor Connectivity of the Alternating Group Graph. 2150014:1-2150014:10 - Joshua Brudnak, László Lipták:
Connectivity Properties of Generalized K4-Hypercubes. 2150015:1-2150015:13 - Chenying Hao, Shurong Zhang, Weihua Yang:
Maintaining Constrained Path Problem for Directed Acyclic Graphs. 2150016:1-2150016:13 - Soamdeep Singha, Biswapati Jana, Niranjan Kumar Mandal:
Active Queue Management in RED Considering Critical Point on Target Queue. 2150017:1-2150017:21 - Mohamed Hechmi Jeridi, Sami Elmadssia, Tahar Ezzedine:
Routing in IoT Lossy Networks: Potential Issues and Proposed Changes. 2150018:1-2150018:31
Volume 21, Number 4, December 2021
- Yaping Mao:
Preface. 2102001:1 - Yingbin Ma, Wenhan Zhu:
Tight Upper Bound of the 3-Total-Rainbow Index for 2-(Edge-)Connected Graphs. 2142001:1-2142001:14 - Miaomiao Zhuo, Qinqin Li, Baoyindureng Wu, Xinhui An:
Average Edge-Connectivity of Cubic Graphs. 2142002:1-2142002:15 - Ning Zhao, Yinkui Li:
The Vulnerability of k-Uniform Linear Hypergraph. 2142003:1-2142003:9 - Yuefang Sun, Gregory Z. Gutin:
Strong Subgraph Connectivity of Digraphs: A Survey. 2142004:1-2142004:16 - Xiang Qin, Yanhua Zhao, Baoyindureng Wu:
Wiener Index of k-Connected Graphs. 2142005:1-2142005:7 - Yingying Zhang, Xiaoyu Zhu:
Total Proper Connection and Graph Operations. 2142006:1-2142006:13 - Zhaojun Sun, Bing Qi, Wei Zhang:
The Capture and Assessment system of Student Activity-Based State Recognition for Physical Education. 2142007:1-2142007:21 - Yulong Wei, Ronghua Li, Weihua Yang:
The g-Extra Edge-Connectivity of Balanced Hypercubes. 2142008:1-2142008:9 - Mei-Mei Gu, Jou-Ming Chang:
A Note on Super Connectivity of the Bouwer Graph. 2142009:1-2142009:8 - Litao Guo, Jun Ge:
Note on Reliability Analysis of Cartesian Product of Networks for Components. 2142010:1-2142010:7 - Jinqiu Zhou, Qunfang Li, Sufang Liu:
A Note on Connectivity of a Cubic Graph. 2142011:1-2142011:6 - Xiaoxiao Qin, Ting Xie, Wen Li, Yinkui Li:
Extremal Graphs on the Rupture Degree. 2142012:1-2142012:8
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-11-27 01:12 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
