Conţinutul numărului revistei |
Articolul precedent |
Articolul urmator |
416 11 |
Ultima descărcare din IBN: 2024-02-07 08:10 |
Căutarea după subiecte similare conform CZU |
519.17 (68) |
Combinatorial analysis. Graph theory (115) |
SM ISO690:2012 SWAMY, Narahari Narasimha, SOORYANARAYANA, Badekara, AKSHARA, Prasad S. P.. Magic Sigma Coloring of a Graph. In: Computer Science Journal of Moldova, 2021, nr. 2(86), pp. 257-270. ISSN 1561-4042. |
EXPORT metadate: Google Scholar Crossref CERIF DataCite Dublin Core |
Computer Science Journal of Moldova | ||||||
Numărul 2(86) / 2021 / ISSN 1561-4042 /ISSNe 2587-4330 | ||||||
|
||||||
CZU: 519.17 | ||||||
MSC 2010: 2010. 05C15. | ||||||
Pag. 257-270 | ||||||
|
||||||
Descarcă PDF | ||||||
Rezumat | ||||||
A sigma coloring of a non-trivial connected graph G is a coloring c : V (G) → N such that (u) 6= (v) for every two adjacent vertices u, v ∈ V (G), where (v) is the sum of the colors of the vertices in the open neighborhood N(v) of v ∈ V (G). The minimum number of colors required in a sigma coloring of a graph G is called the sigma chromatic number of G, denoted (G). A coloring c : V (G) → {1, 2, · · · , k} is said to be a magic sigma coloring of G if the sum of colors of all the vertices in the open neighborhood of each vertex of G is the same. In this paper, we study some of the properties of magic sigma coloring of a graph. Further, we define the magic sigma chromatic number of a graph and determine it for some known families of graphs. |
||||||
Cuvinte-cheie Sigma Coloring, open neighborhood sum, magic sigma coloring, sigma chromatic number |
||||||
|