FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W4206739806> ?p ?o ?g. }

• W4206739806 endingPage "51" @default.
• W4206739806 startingPage "32" @default.
• W4206739806 abstract "A neighbor-sum-distinguishing W-edge-weighting of a graph G=(V,E) is an assignment ω of weights from a set of integers W to the set of edges E of G such that for every pair of adjacent vertices, the incident sums induced by the edge-weighting are different, where the incident sum of a vertex v induced by the edge-weighting ω is σ(v)=∑u∈N(v)ω(uv), where N(v) is the set of neighbors of v in G. Whereas, a neighbor-sum-2-distinguishing W-edge-weighting of G is a neighbor-sum-distinguishing W-edge-weighting such that the incident sums of every pair of adjacent vertices differ by at least 2. A recently proposed conjecture about neighbor-sum-2-distinguishing {1,3,5}-edge-weighting states that any graph with no component isomorphic to K2 admits a neighbor-sum-2-distinguishing {1,3,5}-edge-weighting. In this paper, we prove that deciding whether there exists a neighbor-sum-2-distinguishing {1,3}-edge-weighting is NP-complete for bipartite graphs. We present an algorithm that computes a neighbor-sum-2-distinguishing {1,3}-edge-weighting of the central graph of any graph in polynomial time and thus proves the above conjecture for the central graph of any graph. Further, we establish that if any pair of graphs G and H admit neighbor-sum-2-distinguishing edge-weightings, then so does their Cartesian product, G□H. We study another aspect of neighbor-sum-2-distinguishing edge-weighting of a graph G, namely, the minimum number of incident sums used by a neighbor-sum-2-distinguishing {1,3}-edge-weighting, which is denoted by γΣ>1,{1,3}(G). We prove that the problems of deciding whether there exists a neighbor-sum-2-distinguishing {1,3}-edge-weighting of G from a given set of sums, and deciding whether γΣ>1,{1,3}(G)≤k are NP-complete for bipartite graphs. On the positive side, we provide both upper and lower bounds on γΣ>1,{1,3}(C(G)) for central graphs of bipartite graphs and split graphs. We also propose an algorithm that computes the optimal neighbor-sum-2-distinguishing {1,3}-edge-weighting of the central graphs of cycles and paths in polynomial time." @default.
• W4206739806 created "2022-01-26" @default.
• W4206739806 creator A5021080821 @default.
• W4206739806 creator A5061095539 @default.
• W4206739806 date "2022-03-01" @default.
• W4206739806 modified "2023-09-23" @default.
• W4206739806 title "Complexity and algorithms for neighbor-sum-2-distinguishing {1,3}-edge-weighting of graphs" @default.
• W4206739806 cites W1981798582 @default.
• W4206739806 cites W1991925535 @default.
• W4206739806 cites W2007385106 @default.
• W4206739806 cites W2058759738 @default.
• W4206739806 cites W2075047823 @default.
• W4206739806 cites W2101489005 @default.
• W4206739806 cites W2489305169 @default.
• W4206739806 cites W2734396578 @default.
• W4206739806 cites W2883387158 @default.
• W4206739806 cites W3047680049 @default.
• W4206739806 cites W3113273579 @default.
• W4206739806 doi "https://doi.org/10.1016/j.tcs.2022.01.003" @default.
• W4206739806 hasPublicationYear "2022" @default.
• W4206739806 type Work @default.
• W4206739806 citedByCount "2" @default.
• W4206739806 countsByYear W42067398062022 @default.
• W4206739806 countsByYear W42067398062023 @default.
• W4206739806 crossrefType "journal-article" @default.
• W4206739806 hasAuthorship W4206739806A5021080821 @default.
• W4206739806 hasAuthorship W4206739806A5061095539 @default.
• W4206739806 hasConcept C113238511 @default.
• W4206739806 hasConcept C114614502 @default.
• W4206739806 hasConcept C118615104 @default.
• W4206739806 hasConcept C121332964 @default.
• W4206739806 hasConcept C132525143 @default.
• W4206739806 hasConcept C154945302 @default.
• W4206739806 hasConcept C183115368 @default.
• W4206739806 hasConcept C197657726 @default.
• W4206739806 hasConcept C24890656 @default.
• W4206739806 hasConcept C2780990831 @default.
• W4206739806 hasConcept C33923547 @default.
• W4206739806 hasConcept C41008148 @default.
• W4206739806 hasConcept C65236422 @default.
• W4206739806 hasConcept C80899671 @default.
• W4206739806 hasConceptScore W4206739806C113238511 @default.
• W4206739806 hasConceptScore W4206739806C114614502 @default.
• W4206739806 hasConceptScore W4206739806C118615104 @default.
• W4206739806 hasConceptScore W4206739806C121332964 @default.
• W4206739806 hasConceptScore W4206739806C132525143 @default.
• W4206739806 hasConceptScore W4206739806C154945302 @default.
• W4206739806 hasConceptScore W4206739806C183115368 @default.
• W4206739806 hasConceptScore W4206739806C197657726 @default.
• W4206739806 hasConceptScore W4206739806C24890656 @default.
• W4206739806 hasConceptScore W4206739806C2780990831 @default.
• W4206739806 hasConceptScore W4206739806C33923547 @default.
• W4206739806 hasConceptScore W4206739806C41008148 @default.
• W4206739806 hasConceptScore W4206739806C65236422 @default.
• W4206739806 hasConceptScore W4206739806C80899671 @default.
• W4206739806 hasFunder F4320320721 @default.
• W4206739806 hasLocation W42067398061 @default.
• W4206739806 hasOpenAccess W4206739806 @default.
• W4206739806 hasPrimaryLocation W42067398061 @default.
• W4206739806 hasRelatedWork W1779359754 @default.
• W4206739806 hasRelatedWork W1988771411 @default.
• W4206739806 hasRelatedWork W2587433615 @default.
• W4206739806 hasRelatedWork W2809605638 @default.
• W4206739806 hasRelatedWork W2990042548 @default.
• W4206739806 hasRelatedWork W3049229033 @default.
• W4206739806 hasRelatedWork W3181624001 @default.
• W4206739806 hasRelatedWork W4285056899 @default.
• W4206739806 hasRelatedWork W4297676365 @default.
• W4206739806 hasRelatedWork W755952011 @default.
• W4206739806 hasVolume "906" @default.
• W4206739806 isParatext "false" @default.
• W4206739806 isRetracted "false" @default.
• W4206739806 workType "article" @default.