On l(T, 1)-colouring of certain classes of graphs
- Title
- On l(T, 1)-colouring of certain classes of graphs
- Creator
- Pandey P.; Joseph M.
- Description
- For a given set T of non-negative integers including zero and a positive integer k, the L(T, 1)-Colouring of a graph G = (V, E) is a function c: V(G) ? {0, 0, , k} such that |c(u) ? c(v)| ? T if the distance between u and v is 1 and |c(u) ? c(v)| ? 0 whenever u and v are at distance 2. The L(T,1)-span, ?T,1(G) is the smallest positive integer k such that G admits an L(T, 1)-Colouring. In this article we initiate a study of this concept of L(T, 1)-Colouring by determining the value of ?T,1(G) for some classes of graphs and present algorithms to obtain the L(T, 1)-Colouring of paths and stars. 2020 IJSTR.
- Source
- International Journal of Scientific and Technology Research, Vol-9, No. 3, pp. 6724-6731.
- Date
- 2020-01-01
- Publisher
- International Journal of Scientific and Technology Research
- Subject
- Algorithms; Channel Assignment; Graph colouring; L(T,1)-span
- Coverage
- Pandey P., Department of Mathematics, CHRIST (Deemed to be University, India; Joseph M., Department of Mathematics, CHRIST (Deemed to be University, India
- Rights
- Restricted Access
- Relation
- ISSN: 22778616
- Format
- Online
- Language
- English
- Type
- Article
Collection
Citation
Pandey P.; Joseph M., “On l(T, 1)-colouring of certain classes of graphs,” CHRIST (Deemed To Be University) Institutional Repository, accessed February 25, 2025, https://archives.christuniversity.in/items/show/16330.