Matches in SemOpenAlex for { <https://semopenalex.org/work/W3036272553> ?p ?o ?g. }
Showing items 1 to 48 of
48
with 100 items per page.
- W3036272553 abstract "Let c : V(G) → be a coloring of the vertices in a graph G. For a vertex u in G, the color sum of u, denoted by σ(u), is the sum of the colors of the neighbors of u. The coloring c is called a sigma coloring of G if σ(u) ≠ σ(v) whenever u and v are adjacent vertices in G. The minimum number of colors that can be used in a sigma coloring of G is called the sigma chromatic number of G and is denoted by σ(G). Given two simple, connected graphs G and H, the corona of G and H, denoted by G ⊙ H, is the graph obtained by taking one copy of G and |V(G)| copies of H and where the ith vertex of G is adjacent to every vertex of the ith copy of H. In this study, we will show that for a graph G with |V(G)| ≥ 2, and a complete graph Kn of order n, n ≤ σ(G ⊙ Kn ) ≤ max {σ(G), n}. In addition, let Pn and Cn denote a path and a cycle of order n respectively. If m, n ≥ 3, we will prove that σ(Km ⊙ Pn ) = 2 if and only if . If n is even, we show that σ(Km ⊙ Cn ) = 2 if and only if . Furthermore, in the case that n is odd, we show that σ(Km ⊙ Cn ) = 3 if and only if where H(r, s) denotes the number of lattice points in the convex hull of points on the plane determined by the integer parameters r and s." @default.
- W3036272553 created "2020-06-25" @default.
- W3036272553 creator A5014746409 @default.
- W3036272553 creator A5054801749 @default.
- W3036272553 creator A5073269789 @default.
- W3036272553 date "2020-05-01" @default.
- W3036272553 modified "2023-09-25" @default.
- W3036272553 title "Sigma chromatic number of graph coronas involving complete graphs" @default.
- W3036272553 cites W2029105623 @default.
- W3036272553 cites W2101062861 @default.
- W3036272553 cites W2491838944 @default.
- W3036272553 doi "https://doi.org/10.1088/1742-6596/1538/1/012003" @default.
- W3036272553 hasPublicationYear "2020" @default.
- W3036272553 type Work @default.
- W3036272553 sameAs 3036272553 @default.
- W3036272553 citedByCount "0" @default.
- W3036272553 crossrefType "journal-article" @default.
- W3036272553 hasAuthorship W3036272553A5014746409 @default.
- W3036272553 hasAuthorship W3036272553A5054801749 @default.
- W3036272553 hasAuthorship W3036272553A5073269789 @default.
- W3036272553 hasBestOaLocation W30362725531 @default.
- W3036272553 hasConcept C114614502 @default.
- W3036272553 hasConcept C118615104 @default.
- W3036272553 hasConcept C132525143 @default.
- W3036272553 hasConcept C33923547 @default.
- W3036272553 hasConcept C80899671 @default.
- W3036272553 hasConceptScore W3036272553C114614502 @default.
- W3036272553 hasConceptScore W3036272553C118615104 @default.
- W3036272553 hasConceptScore W3036272553C132525143 @default.
- W3036272553 hasConceptScore W3036272553C33923547 @default.
- W3036272553 hasConceptScore W3036272553C80899671 @default.
- W3036272553 hasLocation W30362725531 @default.
- W3036272553 hasOpenAccess W3036272553 @default.
- W3036272553 hasPrimaryLocation W30362725531 @default.
- W3036272553 hasRelatedWork W16667695 @default.
- W3036272553 hasRelatedWork W25648989 @default.
- W3036272553 hasRelatedWork W28972128 @default.
- W3036272553 hasRelatedWork W30750922 @default.
- W3036272553 hasRelatedWork W32827807 @default.
- W3036272553 hasRelatedWork W35518381 @default.
- W3036272553 hasRelatedWork W41478491 @default.
- W3036272553 hasRelatedWork W4318847 @default.
- W3036272553 hasRelatedWork W50777533 @default.
- W3036272553 hasRelatedWork W21763185 @default.
- W3036272553 isParatext "false" @default.
- W3036272553 isRetracted "false" @default.
- W3036272553 magId "3036272553" @default.
- W3036272553 workType "article" @default.