Gelişmiş Arama

Basit öğe kaydını göster

dc.contributor.authorPandey, Priyankaen_US
dc.contributor.authorKureethara, Joseph Vargheseen_US
dc.date.accessioned2022-01-17T23:12:14Z
dc.date.available2022-01-17T23:12:14Z
dc.date.issued2022
dc.identifier.citationPandey, P. & Kureethara, J. V. (2022). L(t, 1)-colouring of graphs.TWMS Journal Of Applied And Engineering Mathematics, 12(1), 296-301.en_US
dc.identifier.issn2146-1147en_US
dc.identifier.issn2587-1013en_US
dc.identifier.urihttp://belgelik.isikun.edu.tr/xmlui/handle/iubelgelik/3408
dc.identifier.urihttp://jaem.isikun.edu.tr/web/index.php/archive/114-vol12no1/813
dc.description.abstractOne of the most famous applications of Graph Theory is in the field of Channel Assignment Problems. There are varieties of graph colouring concepts that are used for different requirements of frequency assignments in communication channels. We introduce here L(t, 1)-colouring of graphs. This has its foundation in T-colouring and L(p, q)-colouring. For a given finite set T including zero, an L(t, 1)-colouring of a graph G is an assignment of non-negative integers to the vertices of G such that the difference between the colours of adjacent vertices must not belong to the set T and the colours of vertices that are at distance two must be distinct. The variable t in L(t, 1) denotes the elements of the set T. For a graph G, the L(t, 1)-span of G is the minimum of the highest colour used to colour the vertices of a graph out of all the possible L(t, 1)-colourings. It is denoted by ?t,1(G). We study some properties of L(t, 1)-colouring. We also find upper bounds of ?t,1(G) of stars and multipartite graphs.en_US
dc.language.isoenen_US
dc.publisherIşık University Pressen_US
dc.relation.ispartofTWMS Journal Of Applied And Engineering Mathematicsen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.rightsAttribution-NonCommercial-NoDerivs 3.0 United States*
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/3.0/us/*
dc.subjectColour spanen_US
dc.subjectCommunication networksen_US
dc.subjectL(t, 1)-colouringen_US
dc.subjectRadio frequencyen_US
dc.titleL(t, 1)-colouring of graphsen_US
dc.typeArticleen_US
dc.description.versionPublisher's Versionen_US
dc.identifier.volume12
dc.identifier.issue1
dc.identifier.startpage296
dc.identifier.endpage301
dc.peerreviewedYesen_US
dc.publicationstatusPublisheden_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Başka Kurum Yazarıen_US


Bu öğenin dosyaları:

Thumbnail

Bu öğe aşağıdaki koleksiyon(lar)da görünmektedir.

Basit öğe kaydını göster

info:eu-repo/semantics/openAccess
Aksi belirtilmediği sürece bu öğenin lisansı: info:eu-repo/semantics/openAccess