Complexity and algorithms for neighbor-sum-2-distinguishing \(\{1,3\}\)-edge-weighting of graphs (Q2077391): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.tcs.2022.01.003 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W4206739806 / rank | |||
Normal rank | |||
Revision as of 21:01, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity and algorithms for neighbor-sum-2-distinguishing \(\{1,3\}\)-edge-weighting of graphs |
scientific article |
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
