On /delta^(k)-colouring of Powers of Paths and Cycles
- Title
- On /delta^(k)-colouring of Powers of Paths and Cycles
- Creator
- Ms M.T.E.; Naduvath S.
- Description
- In animpropervertexcolouringofagraph,adjacentverticesarepermittedto receivesamecolours.Anedgeofanimproperlycolouredgraphissaidtobeabad edge ifitsendverticeshavethesamecolour.Anear-propercolouringofagraphis a colouringwhichminimisesthenumberofbadedgesbyrestrictingthenumberof colour classes that can have adjacency among their own elements. The ?(k)- colouring is anear-propercolouringof G consisting of k givencolours,where1 ? k ? ?(G) ? 1, whichminimisesthenumberofbadedgesbypermittingatmostonecolourclassto have adjacency among the vertices in it. In this paper,we discuss the number of bad edges ofpowers of paths and cycles. Published by Digital Commons@Georgia Southern, 2021. 2021 Georgia Southern University. All rights reserved.
- Source
- Theory and Applications of Graphs, Vol-8, No. 2
- Date
- 2021-01-01
- Publisher
- Georgia Southern University
- Subject
- Badedges; Impropercolouring; Near-propercolouring; ?(k)-colouring
- Coverage
- Ms M.T.E., Christ University, Bangalore, India; Naduvath S., Christ University, Bangalore, India
- Rights
- All Open Access; Gold Open Access
- Relation
- ISSN: 24709859
- Format
- Online
- Language
- English
- Type
- Article
Collection
Citation
Ms M.T.E.; Naduvath S., “On /delta^(k)-colouring of Powers of Paths and Cycles,” CHRIST (Deemed To Be University) Institutional Repository, accessed February 25, 2025, https://archives.christuniversity.in/items/show/16055.