{"@context":["https://w3id.org/fdo/context/v1",{"schema":"https://schema.org/","prov":"http://www.w3.org/ns/prov#","fdo":"https://w3id.org/fdo/vocabulary/"}],"@id":"https://fdo.portal.mardi4nfdi.de/fdo/Q401154","@type":"DigitalObject","kernel":{"@id":"https://fdo.portal.mardi4nfdi.de/fdo/Q401154","digitalObjectType":"https://schema.org/ScholarlyArticle","primaryIdentifier":"mardi:Q401154","kernelVersion":"v1","immutable":true,"modified":"2026-01-20T21:26:48Z"},"profile":{"@context":"https://schema.org","@type":"ScholarlyArticle","@id":"https://portal.mardi4nfdi.de/entity/Q401154","name":"An improved upper bound for the neighbor sum distinguishing index of graphs","headline":"An improved upper bound for the neighbor sum distinguishing index of graphs","description":"scientific article; zbMATH DE number 6334407","url":"https://portal.mardi4nfdi.de/entity/Q401154","datePublished":"2014-08-26","author":[{"@id":"https://portal.mardi4nfdi.de/entity/Q591521"},{"@id":"https://portal.mardi4nfdi.de/entity/Q249728"}],"publisher":[{"@id":"https://portal.mardi4nfdi.de/entity/Q96294"}],"identifier":{"@type":"PropertyValue","propertyID":"doi","value":"10.1016/J.DAM.2014.05.013","url":"https://doi.org/10.1016/J.DAM.2014.05.013"},"sameAs":["https://doi.org/10.1016/J.DAM.2014.05.013"],"citation":[{"@id":"https://portal.mardi4nfdi.de/entity/Q856841"},{"@id":"https://portal.mardi4nfdi.de/entity/Q5454274"},{"@id":"https://portal.mardi4nfdi.de/entity/Q5422499"},{"@id":"https://portal.mardi4nfdi.de/entity/Q3092678"},{"@id":"https://portal.mardi4nfdi.de/entity/Q4903632"},{"@id":"https://portal.mardi4nfdi.de/entity/Q2636830"},{"@id":"https://portal.mardi4nfdi.de/entity/Q855303"},{"@id":"https://portal.mardi4nfdi.de/entity/Q367074"},{"@id":"https://portal.mardi4nfdi.de/entity/Q2573644"},{"@id":"https://portal.mardi4nfdi.de/entity/Q987498"},{"@id":"https://portal.mardi4nfdi.de/entity/Q654244"},{"@id":"https://portal.mardi4nfdi.de/entity/Q1609524"}]},"provenance":{"prov:generatedAtTime":"2026-01-20T21:26:48Z","prov:wasAttributedTo":"MaRDI Knowledge Graph"}}