L(j, k)-number of direct product of path and cycle

DOI10.1007/S10114-013-2021-7MaRDI QIDQ2391993zbMATH OpenOpenAlexFDO

Publication date 6 August 2013

Published in Acta Mathematica Sinica, English Series (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10114-013-2021-7

$L(j k)$-labeling product of a path and a cycle

Extremal problems in graph theory (05C35) Graph operations (line graphs, products, etc.) (05C76) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Recommendations

L(j,k)-labeling number of Cartesian product of path and cycle
Circular $L(j,k)$-labeling number of direct product of path and cycle
$L(2,1)$-labeling of direct product of paths and cycles
$L (j, k)$- and circular $L(j, k)$-labellings for the products of complete graphs

Cites work

$L(2,1)$-labeling of direct product of paths and cycles
$L(2,1)$-labeling of strong products of cycles
$L(2,1)$-labelings on the composition of $n$ graphs
$L(h,1)$-labeling subclasses of planar graphs
A survey on labeling graphs with a condition at distance two
Circular $L(j,k)$-labeling number of direct product of path and cycle
Computing graph invariants on rotagraphs using dynamic algorithm approach: The case of (2, 1)-colorings and independence numbers
Efficient distributions of arms‐control inspection effort
scientific article; zbMATH DE number 1185300 (Why is no real title available?)
scientific article; zbMATH DE number 1792593 (Why is no real title available?)
scientific article; zbMATH DE number 1439442 (Why is no real title available?)
Labeling products of complete graphs with a condition at distance two
Labeling trees with a condition at distance two
On L(2,1)-labelings of Cartesian products of paths and cycles
On $L(d,1)$-labeling of Cartesian product of a cycle and a path
On labeling the vertices of products of complete graphs with distance constraints
On the $\lambda$-Number of $Q_n $ and Related Graphs
Optimal L(2,1)-labeling of Cartesian products of cycles, with an application to independent domination
Optimal $L(d,1)$-labelings of certain direct products of cycles and Cartesian products of cycles
Optimal $L(h,k)$-labeling of regular grids
Optimal L(2, 1)-labeling of strong products of cycles [transmitter frequency assignment]
Real Number Channel Assignments for Lattices
Recent progress in mathematics and engineering on optimal graph labellings with distance conditions
The L(2,1)-labeling and operations of graphs

Cited in

(7)

$L(j,k)$-labeling numbers of square of paths
Lambda number for the direct product of some family of graphs
2-distance colorings of some direct products of paths and cycles
Circular $L(j,k)$-labeling number of direct product of path and cycle
scientific article; zbMATH DE number 5811332 (Why is no real title available?)
$L(1, 2)$-labeling numbers on square of cycles
L(j,k)-labeling number of Cartesian product of path and cycle

This page was built for publication: $L(j, k)$-number of direct product of path and cycle

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2391993)