We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
Sigma Chromatic Number of Some Graphs.
- Authors
Pillai, Preethi K.; Kumar, J. Suresh
- Abstract
The Sigma colouring (σ - colouring) of a graph σ with G vertices is an injection from V(G) to {1,2,...} such that the colour sums (adding the colours of the neighbouring vertices) of any two neighbouring vertices are different. The smallest number of colours needed to colour a graph G is represented by its Sigma Chromatic number, σ(G). In this article we obtain the σ-colouring of some graphs such as Barbell Graph, Twig graph, Shell graph, Tadpole, Lollipop, Fusing all the vertices of cycle and duplication of every edge by a vertex in Cn.
- Subjects
GRAPH theory; GEOMETRIC vertices; EDGES (Geometry); MATHEMATICAL formulas; MATHEMATICAL analysis
- Publication
Mapana Journal of Sciences, 2023, Vol 22, p41
- ISSN
0975-3303
- Publication type
Article
- DOI
10.12723/mjs.sp1.4