On the \lambda-Number of Q_n and Related Graphs

DOI10.1137/S0895480192242821MaRDI QIDQ4863972zbMATHzbMATHOpenAlexFDO

Authors Marshall A. Whittlesey, John P. Georges, David Mauro

Publication date 20 February 1996

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/s0895480192242821

zbMATH Keywords

$\lambda$-number vertex labelling cube graphs $\lambda$-labelling

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Recommendations

Notes on $L(1,1)$ and $L(2,1)$ labelings for $n$-cube
$L(p,q)$ labeling of $d$-dimensional grids
scientific article; zbMATH DE number 2145257
Distance labellings of graphs
scientific article; zbMATH DE number 1409224

Cited in

(84)

$(p,q)$-total labeling of complete graphs
Distance-constrained labellings of Cartesian products of graphs
Lambda number of the power graph of a finite group
scientific article; zbMATH DE number 5263356 (Why is no real title available?)
Nordhaus-Gaddum-type results for path covering and $L(2,1)$-labeling numbers
On irreducible no-hole $L(2, 1)$-coloring of Cartesian product of trees with paths
$L(2,1)$-colorings and irreducible no-hole colorings of Cartesian product of graphs
Two results on $k$-$(2,1)$-total choosability of planar graphs
A new sufficient condition for a tree $T$ to have the $(2,1)$-total number $\Delta +1$
THE λ-NUMBER OF THE CARTESIAN PRODUCT OF A COMPLETE GRAPH AND A CYCLE
2-distance colorings of some direct products of paths and cycles
The $(d, 1)$-total labelling of Sierpiński-like graphs
List backbone colouring of graphs
scientific article; zbMATH DE number 5669517 (Why is no real title available?)
Lambda number for the direct product of some family of graphs
On irreducible no-hole $L(2,1)$-coloring of subdivision of graphs
$L(2,1)$-labelings of the edge-multiplicity-paths-replacement of a graph
A sufficient condition for a tree to be $(\Delta+1)$-$(2,1)$-totally labelable
$(2,1)$-total labeling of trees with large maximum degree
On $(d,1)$-total numbers of graphs
$L(2,1)$-labeling of direct product of paths and cycles
On $L(d,1)$-labeling of Cartesian product of a cycle and a path
$(p,1)$-total labelling of graphs
A survey on labeling graphs with a condition at distance two
The $L(2,1)$-labeling on the skew and converse skew products of graphs
$L(2,1)$-labelings of subdivisions of graphs
The $L(2,1)$-labeling on Cartesian sum of graphs
$L(2,1)$-labeling for brick product graphs
Some results on distance two labelling of outerplanar graphs
Optimal $L(d,1)$-labelings of certain direct products of cycles and Cartesian products of cycles
Coloring the square of the Cartesian product of two cycles
A bound on the chromatic number of the square of a planar graph
$L(p,q)$ labeling of $d$-dimensional grids
$(d,1)$-total labelling of planar graphs with large girth and high maximum degree
The minimum span of $L(2,1)$-labelings of certain generalized Petersen graphs
On critical trees labeled with a condition at distance two
An O$(n^{1.75})$ algorithm for $L(2,1)$-labeling of trees
scientific article; zbMATH DE number 5869 (Why is no real title available?)
On $(p,1)$-total labelling of planar graphs
The 2-dipath chromatic number of Halin graphs
$L(j,k)$-labelling and maximum ordering-degrees for trees
Distance-two labelings of digraphs
A distance-labelling problem for hypercubes
Fixed-parameter complexity of $\lambda$-labelings
$L(j, k)$-number of direct product of path and cycle
On $L(2,1)$-labelings of Cartesian products of paths and cycles
Improved upper bounds on the $L(2,1)$-labeling of the skew and converse skew product graphs
The $(p,q)$-total labeling problem for trees
(2,1)-total labelling of trees with sparse vertices of maximum degree
$ L ( p , q )$-labelings of subdivisions of graphs
$(2,1)$-Total number of trees with maximum degree three
On the $L(p,1)$-labelling of graphs
The $L(2,1)$-labeling on graphs and the frequency assignment problem
The $(2,1)$-total labeling number of outerplanar graphs is at most $\Delta + 2$
On irreducible no-hole $L(2, 1)$-labelings of hypercubes and triangular lattices
Backbone coloring for graphs with large girths
$L(d,1)$-labelings of the edge-path-replacement of a graph
Labelling planar graphs without 4-cycles with a condition on distance two
On $(p,1)$-total labelling of 1-planar graphs
$L(2,1)$-labelings of Cartesian products of two cycles
Labeling trees with a condition at distance two
A $q$-analogue of the addressing problem of graphs by Graham and Pollak
On the $L(2,1)$-labelings of amalgamations of graphs
Irreducible no-hole $L(2, 1)$-coloring of edge-multiplicity-paths-replacement graph
A note on collections of graphs with non-surjective lambda labelings
A tight upper bound on the ($2,1$)-total labeling number of outerplanar graphs
No-hole $L(2,1)$-colorings
Distance Labelling Problems for Hypercubes and Hamming Graphs – A Survey
$(2,1)$-total labeling of a class of subcubic graphs
Distance-two labelings of graphs
$L(1,1)$-labelling of the direct product of a complete graph and a cycle
$L(h,k)$-labelings of Hamming graphs
$L(2, 1)$-labelings of the edge-path-replacement of a graph
Acyclic colorings of products of trees
Notes on $L(1,1)$ and $L(2,1)$ labelings for $n$-cube
Distance two labelling and direct products of graphs
Computing graph invariants on rotagraphs using dynamic algorithm approach: The case of (2, 1)-colorings and independence numbers
A Radio Coloring of a Hypercube
The $L(2,1)$-labelling of trees
$L (j, k)$- and circular $L(j, k)$-labellings for the products of complete graphs
The minimum span of $L(2,1)$-labelings of generalized flowers
Path covering number and $L(2,1)$-labeling number of graphs
$(2,1)$-total labelling of outerplanar graphs
$L(h, k)$-labelling for octagonal grid

This page was built for publication: On the $\lambda$-Number of $Q_n $ and Related Graphs

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