Algorithmic study of \(d_2\)-transitivity of graphs (Q6561577)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Algorithmic study of dā-transitivity of graphs |
scientific article; zbMATH DE number 7870975
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithmic study of \(d_2\)-transitivity of graphs |
scientific article; zbMATH DE number 7870975 |
Statements
Algorithmic study of \(d_2\)-transitivity of graphs (English)
0 references
25 June 2024
0 references
\(d_2\)-transitivity
0 references
linear algorithm
0 references
NP-completeness
0 references
split graphs
0 references
bipartite graphs
0 references
0.9298889636993408
0 references
0.8644578456878662
0 references
0.7599233984947205
0 references
0.7554259896278381
0 references
