The distinguishing number and the distinguishing index of graphs from primary subgraphs (Q4988455): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Symmetry breaking in graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Nonblind and Semiblind Space-Frequency Multiuser Detection for Multirate MC-CDMA Systems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Computing Hosoya polynomials of graphs from primary subgraphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4913985 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3005852 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Distinguishing graphs by edge-colourings / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3649835 / rank | |||
Normal rank | |||
Latest revision as of 18:32, 25 July 2024
scientific article; zbMATH DE number 7348459
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The distinguishing number and the distinguishing index of graphs from primary subgraphs |
scientific article; zbMATH DE number 7348459 |
Statements
17 May 2021
0 references
distinguishing index
0 references
distinguishing number
0 references
chain
0 references
link
0 references
The distinguishing number and the distinguishing index of graphs from primary subgraphs (English)
0 references
0 references
