\((p,1)\)-total labelling of graphs (Q2467731): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: The Colour Numbers of Complete Graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On \(L(d,1)\)-labelings of graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The list chromatic index of a bipartite multigraph / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Labelling Graphs with a Condition at Distance 2 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On total colourings of graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A bound on the total chromatic number / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Graph colouring and the probabilistic method / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the $\lambda$-Number of $Q_n $ and Related Graphs / rank | |||
Normal rank |
Latest revision as of 16:03, 27 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | \((p,1)\)-total labelling of graphs |
scientific article |
Statements
\((p,1)\)-total labelling of graphs (English)
0 references
28 January 2008
0 references
Let \(V\) and \(E\) denote respectively the set of vertices and the set of edges of a graph \(G\). A \((p,1)\)-total labelling of \(G\) means assigning integers to \(V\cup E\) satisfying the following (i) and two adjacent vertices of \(G\) carry distinct integers, (ii) any two adjacent edges of \(G\) are assigned distinct integers, and (iii) a vertex and its incident edge receive integers that differ by at least \(|p|\) which is the absolute value of \(p\). The maximum difference between two labels is called the span of a \((p, 1)\)-total labelling. The \((p, 1)\)-total number denoted by \(\lambda^T_p(G)\), of \(G\) is the minimum span of a \((p,1)\)-total labelling of \(G\). In this paper, the authors provide lower and upper bounds for \(\lambda^T_p(G)\), and discuss bounds for the \((p,1)\)-total number \(\lambda^T_p(G)\) as a function of the maximum degree \(\Delta\) of \(G\). It is conjectured here that \(\lambda^T_p(G)\leq(\Delta+ 2p-1)\), and the exact value of \(\lambda^T_p(k_n)\) is obtained except when \(n\) is even and is in the interval \([p+5, 6p^2- 10p+ 4]\) for which it is shown that \(\lambda^T_p(k_n)\in [n+ 2p- 3, n+ 2p- 2]\).
0 references
\((p
0 references
1)\)-total labelling
0 references
minimum span
0 references
maximum degree
0 references
bounds for graphs
0 references