On the \(d_2\)-splitting graph of a graph (Q2867592)
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: On the dā-splitting graph of a graph |
scientific article; zbMATH DE number 6241300
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the \(d_2\)-splitting graph of a graph |
scientific article; zbMATH DE number 6241300 |
Statements
19 December 2013
0 references
complete graph
0 references
trees
0 references
bipartite
0 references
complete bipartite
0 references
Eulerian graph
0 references
Hamiltonian graph
0 references
connectivity of a graph
0 references
On the \(d_2\)-splitting graph of a graph (English)
0 references
0.7765193581581116
0 references
0.774486780166626
0 references
0.7601879835128784
0 references
0.7466034889221191
0 references
