On Proper Labellings of Graphs with Minimum Label Sum
Ontology highlight
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
ACCESS DATA