On the sizes of graphs and their powers: the undirected case (Q643002)
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 sizes of graphs and their powers: the undirected case |
scientific article; zbMATH DE number 5964705
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the sizes of graphs and their powers: the undirected case |
scientific article; zbMATH DE number 5964705 |
Statements
On the sizes of graphs and their powers: the undirected case (English)
0 references
27 October 2011
0 references
graph theory
0 references
undirected graph
0 references
diameter
0 references
power of a graph
0 references
transitive closure of a graph
0 references
edge number
0 references
size of a graph
0 references
identifying code
0 references
Hamiltonian graph
0 references
0.8612765073776245
0 references
0.8506395220756531
0 references
0.8216204643249512
0 references
0.7547063827514648
0 references
