Matches in SemOpenAlex for { <https://semopenalex.org/work/W4313679698> ?p ?o ?g. }
Showing items 1 to 49 of
49
with 100 items per page.
- W4313679698 abstract "The concept of sum labelling was introduced in 1990 by Harary. A graph is a sum graph if its vertices can be labelled by distinct positive integers in such a way that two vertices are connected by an edge if and only if the sum of their labels is the label of another vertex in the graph. It is easy to see that every sum graph has at least one isolated vertex, and every graph can be made a sum graph by adding at most $n^2$ isolated vertices to it. The minimum number of isolated vertices that need to be added to a graph to make it a sum graph is called the sum number of the graph. The sum number of several prominent graph classes (e.g., cycles, trees, complete graphs) is already well known. We examine the effect of taking the disjoint union of graphs on the sum number. In particular, we provide a complete characterization of the sum number of graphs of maximum degree two, since every such graph is the disjoint union of paths and cycles." @default.
- W4313679698 created "2023-01-08" @default.
- W4313679698 creator A5011331683 @default.
- W4313679698 creator A5015688812 @default.
- W4313679698 date "2023-01-05" @default.
- W4313679698 modified "2023-09-30" @default.
- W4313679698 title "Sum Labelling Graphs of Maximum Degree Two" @default.
- W4313679698 doi "https://doi.org/10.48550/arxiv.2301.02178" @default.
- W4313679698 hasPublicationYear "2023" @default.
- W4313679698 type Work @default.
- W4313679698 citedByCount "0" @default.
- W4313679698 crossrefType "posted-content" @default.
- W4313679698 hasAuthorship W4313679698A5011331683 @default.
- W4313679698 hasAuthorship W4313679698A5015688812 @default.
- W4313679698 hasBestOaLocation W43136796981 @default.
- W4313679698 hasConcept C114614502 @default.
- W4313679698 hasConcept C118615104 @default.
- W4313679698 hasConcept C132525143 @default.
- W4313679698 hasConcept C148364342 @default.
- W4313679698 hasConcept C149530733 @default.
- W4313679698 hasConcept C168291704 @default.
- W4313679698 hasConcept C203776342 @default.
- W4313679698 hasConcept C33923547 @default.
- W4313679698 hasConcept C80899671 @default.
- W4313679698 hasConceptScore W4313679698C114614502 @default.
- W4313679698 hasConceptScore W4313679698C118615104 @default.
- W4313679698 hasConceptScore W4313679698C132525143 @default.
- W4313679698 hasConceptScore W4313679698C148364342 @default.
- W4313679698 hasConceptScore W4313679698C149530733 @default.
- W4313679698 hasConceptScore W4313679698C168291704 @default.
- W4313679698 hasConceptScore W4313679698C203776342 @default.
- W4313679698 hasConceptScore W4313679698C33923547 @default.
- W4313679698 hasConceptScore W4313679698C80899671 @default.
- W4313679698 hasLocation W43136796981 @default.
- W4313679698 hasOpenAccess W4313679698 @default.
- W4313679698 hasPrimaryLocation W43136796981 @default.
- W4313679698 hasRelatedWork W1963961477 @default.
- W4313679698 hasRelatedWork W2012462086 @default.
- W4313679698 hasRelatedWork W2049807202 @default.
- W4313679698 hasRelatedWork W2054283971 @default.
- W4313679698 hasRelatedWork W2059556413 @default.
- W4313679698 hasRelatedWork W2161439427 @default.
- W4313679698 hasRelatedWork W2352159560 @default.
- W4313679698 hasRelatedWork W2374778222 @default.
- W4313679698 hasRelatedWork W4229970255 @default.
- W4313679698 hasRelatedWork W4255444748 @default.
- W4313679698 isParatext "false" @default.
- W4313679698 isRetracted "false" @default.
- W4313679698 workType "article" @default.