List version of ($p$,1)-total labellings

Details List version of ($p$,1)-total labellings List version of ($p$,1)-total labellings

2011-05-10

arxiv.org/abs/1105.1906v1

Mathematics

Combinatorics

11 pages, 2 figures

Scientific paper

The ($p$,1)-total number $\lambda_p^T(G)$ of a graph $G$ is the width of the smallest range of integers that suffices to label the vertices and the edges of $G$ such that no two adjacent vertices have the same label, no two incident edges have the same label and the difference between the labels of a vertex and its incident edges is at least $p$. In this paper we consider the list version. Let $L(x)$ be a list of possible colors for all $x\in V(G)\cup E(G)$. Define $C_{p,1}^T(G)$ to be the smallest integer $k$ such that for every list assignment with $|L(x)|=k$ for all $x\in V(G)\cup E(G)$, $G$ has a ($p$,1)-total labelling $c$ such that $c(x)\in L(x)$ for all $x\in V(G)\cup E(G)$. We call $C_{p,1}^T(G)$ the ($p$,1)-total labelling choosability and $G$ is list $L$-($p$,1)-total labelable. In this paper, we present a conjecture on the upper bound of $C_{p,1}^T$. Furthermore, we study this parameter for paths and trees in Section 2. We also prove that $C_{p,1}^T(K_{1,n})\leq n+2p-1$ for star $K_{1,n}$ with $p\geq2, n\geq3$ in Section 3 and $C_{p,1}^T(G)\leq \Delta+2p-1$ for outerplanar graph with $\Delta\geq p+3$ in Section 4.

Affiliated with

Also associated with

No associations

Rating

List version of ($p$,1)-total labellings does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with List version of ($p$,1)-total labellings, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and List version of ($p$,1)-total labellings will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-279116