DSpace Repository

L(p,q)-labeling of graphs with interval representations

Show simple item record

dc.creator Yetim, Mehmet Akif
dc.date 2021-07-01T00:00:00Z
dc.date.accessioned 2021-12-03T11:20:17Z
dc.date.available 2021-12-03T11:20:17Z
dc.identifier 3a0999b5-9d99-4475-a73d-7d0e8f880879
dc.identifier 10.7151/dmgt.2426
dc.identifier https://avesis.sdu.edu.tr/publication/details/3a0999b5-9d99-4475-a73d-7d0e8f880879/oai
dc.identifier.uri http://acikerisim.sdu.edu.tr/xmlui/handle/123456789/90961
dc.description <p>We provide upper bounds on the L(p,q)-labeling number of graphs which have interval (or circular-arc) representations via simple greedy algorithms. We prove that there exists an L(p,q)-labeling with span at most max{2(p+q-1)Δ-4q+2, (2p-1)μ+(2q-1)Δ- 2q+1} for interval k-graphs, max{p,q}Δ for interval graphs, 3max{p,q}Δ+p for circular-arc graphs, 2(p+q-1)Δ-2q+1 for permutation graphs and (2p-1)Δ+(2q-1)(μ-1) for cointerval graphs. In particular, these improve existing bounds on L(p,q)-labeling of interval graphs and L(2,1)-labeling of permutation graphs. Furthermore, we provide upper bounds on the coloring of the squares of aforementioned classes.</p>
dc.language eng
dc.rights info:eu-repo/semantics/closedAccess
dc.title L(p,q)-labeling of graphs with interval representations
dc.type info:eu-repo/semantics/article

Files in this item

Files Size Format View

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record

Search DSpace

Advanced Search


My Account