The distinguishing index of graphs with at least one cycle is not more than its distinguishing number (Q6292896)
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: The distinguishing index of graphs with at least one cycle is not more than its distinguishing number |
scientific article; zbMATH DE number 900330310
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The distinguishing index of graphs with at least one cycle is not more than its distinguishing number |
scientific article; zbMATH DE number 900330310 |
Statements
23 October 2017
0 references
math.CO
0 references
