Our system is currently under heavy load due to increased usage. We're actively working on upgrades to improve performance. Thank you for your patience.
2018
DOI: 10.3103/s0146411618080266
|View full text |Cite
|
Sign up to set email alerts
|

The Use of Adjacency Series for Recognition of Prefractal Graphs in Assessing VANET Cybersecurity

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2021
2021
2022
2022

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 1 publication
0
2
0
Order By: Relevance
“…In the terminology of prefractal graphs [20][21][22], the families of self-similar graphs, such as Farey graphs, 2-dimensional Sierpi ński gasket graphs, Hanoi graphs, modified Koch graphs, Apollonian graphs, pseudofractal scale-free webs, fractal scale-free networks, etc. [23][24][25], are noncanonical prefractal graphs.…”
Section: Introductionmentioning
confidence: 99%
“…In the terminology of prefractal graphs [20][21][22], the families of self-similar graphs, such as Farey graphs, 2-dimensional Sierpi ński gasket graphs, Hanoi graphs, modified Koch graphs, Apollonian graphs, pseudofractal scale-free webs, fractal scale-free networks, etc. [23][24][25], are noncanonical prefractal graphs.…”
Section: Introductionmentioning
confidence: 99%
“…Prefractal graphs [20][21][22] represent a relatively new subclass of large dynamic graphs [23][24][25]. With large prefractal graphs, it is possible to build graph-theoretic models of the structure of social networks and solve various optimization problems on them [26][27][28]-finding the shortest paths, highlighting subgraphs, multicriteria optimization, etc.…”
Section: Introductionmentioning
confidence: 99%