Complexity and algorithms for neighbor-sum-2-distinguishing \(\{1,3\}\)-edge-weighting of graphs (Q2077391)
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: Complexity and algorithms for neighbor-sum-2-distinguishing \(\{1,3\}\)-edge-weighting of graphs |
scientific article; zbMATH DE number 7477131
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity and algorithms for neighbor-sum-2-distinguishing \(\{1,3\}\)-edge-weighting of graphs |
scientific article; zbMATH DE number 7477131 |
Statements
Complexity and algorithms for neighbor-sum-2-distinguishing \(\{1,3\}\)-edge-weighting of graphs (English)
0 references
21 February 2022
0 references
neighbor-sum-2-distinguishing edge-weighting
0 references
NP-complete
0 references
central graphs
0 references
Cartesian product of graphs
0 references
