Unknown

Dataset Information

0

On Proper Labellings of Graphs with Minimum Label Sum


ABSTRACT: The 1-2-3 Conjecture states that every nice graph G (without component isomorphic to We study proper labellings of graphs with the extra requirement that the sum of assigned labels must be as small as possible. That is, given a graph G, we are looking for a locally irregular multigraph We investigate several aspects of this problem. We prove that the problem of designing proper labellings with minimum label sum is

SUBMITTER: Gasieniec L 

PROVIDER: S-EPMC7254921 | biostudies-literature | 2020 Apr

REPOSITORIES: biostudies-literature

Similar Datasets

| S-EPMC4863731 | biostudies-other
| S-EPMC2867465 | biostudies-literature
| S-EPMC9879988 | biostudies-literature
| PRJNA270932 | ENA
| PRJNA831367 | ENA
| PRJNA189095 | ENA
| PRJNA189813 | ENA
| PRJNA1023318 | ENA
| S-EPMC10691542 | biostudies-literature
| S-EPMC6694368 | biostudies-literature