2022
DOI: 10.1016/j.aej.2022.04.022
|View full text |Cite
|
Sign up to set email alerts
|

On infinite circulant-balanced complete multipartite graphs decompositions based on generalized algorithmic approaches

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
1
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
7

Relationship

0
7

Authors

Journals

citations
Cited by 9 publications
(4 citation statements)
references
References 28 publications
0
1
0
Order By: Relevance
“…After the drone successfully assigns tasks, it will start task route selection and data transmission. From the allocation and selection of data collection task points, the planning of task paths, to the process of task transmission, the security of drone transmission is to some extent lacking guarantee [27][28][29][30]. Therefore, to ensure the efficient operation of drones, it is necessary to analyze the transmission security meanwhile.…”
Section: B Uav Safety Spectrum Resource Allocation Strategy Based On ...mentioning
confidence: 99%
“…After the drone successfully assigns tasks, it will start task route selection and data transmission. From the allocation and selection of data collection task points, the planning of task paths, to the process of task transmission, the security of drone transmission is to some extent lacking guarantee [27][28][29][30]. Therefore, to ensure the efficient operation of drones, it is necessary to analyze the transmission security meanwhile.…”
Section: B Uav Safety Spectrum Resource Allocation Strategy Based On ...mentioning
confidence: 99%
“…In 2020, Wang and Wang [7] showed that the 3-good-neighbor connectivity of Modified Bubble-Sort Graphs MBn is 8 24 n − for 6 n ≥ . Motivated by these researches, notice that the Cartesian product is an important method to obtain large graphs from smaller ones for designing large-scale interconnection networks [8] [9] [10]. In this paper, we plan to determine the g-good-neighbor connectivity of the Cartesian product of graphs.…”
Section: Letmentioning
confidence: 99%
“…For a detailed background on these irregularity measure indices, we refer readers to the literature [13][14][15][16]. Tese studies provide a comprehensive overview of the theory and application of irregularity indices in chemical graph theory and cover a wide range of topics such as their mathematical properties, algorithmic complexity, and relationship with other topological indices.…”
Section: Introductionmentioning
confidence: 99%