L(2,1)-labeling for subdivisions of cycle dominated graphs
Summary: Let \(G(V,E)\) be a simple, finite, connected, undirected graph. Distance two labeling or \(L(2,1)\)-labeling of a graph \(G\) is an assignment \(f\) from the vertex set \(V(G)\) to the set of non-negative integers such that \(| f(x)-f(y)| \geq 2\) if \(x\) and \(y\) are adjacent and \(| f(x)-f(y)| \geq 1\) if \(x\) and \(y\) are at distance 2, for all \(x\) and \(y\) in \(V(G)\). The \(L(2,1)\)-labeling number \(\lambda(G)\) of \(G\) is the smallest number \(k\) such that \(G\) has an \(L(2,1)\)-labeling \(f\) with \(\max\{f(v):v\in V(G)\}=k\). In this paper, we construct \(L(2,1)\)-labeling of subdivisions of cycle dominated graphs like subdivided Double Fans, subdivided \(nC_\alpha\) with a common vertex and subdivided Books \(B_n\) and hence we find the \(\lambda\)-number of these graphs.
- \(L(2,1)\)-labelings of subdivisions of graphs
- \( L ( p , q )\)-labelings of subdivisions of graphs
- scientific article; zbMATH DE number 5583498
- \(L(2, 1)\)-labeling of circulant graphs
- (2,1)-total labeling of a class of subcubic graphs
- scientific article; zbMATH DE number 5973500
- scientific article; zbMATH DE number 2073985
- scientific article; zbMATH DE number 2091962
- L(2,1)-labeling of graphs: known results and open problems
- \(L(2,1)\)-labelings on the composition of \(n\) graphs
- L(2,1)-labeling in the context of some graph operations
- A survey on labeling graphs with a condition at distance two
- A Theorem about the Channel Assignment Problem
- Graph theory
- scientific article; zbMATH DE number 3853101 (Why is no real title available?)
- Labelling Graphs with a Condition at Distance 2
- On the \(L(p,1)\)-labelling of graphs
- The $L(2,1)$-Labeling Problem on Graphs
This page was built for publication: \(L(2,1)\)-labeling for subdivisions of cycle dominated graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1653937)
