On the \lambda-Number of Q_n and Related Graphs

DOI10.1137/S0895480192242821zbMATH Open0844.05084OpenAlexW2070694622MaRDI QIDQ4863972FDOQ4863972

John P. Georges, Marshall A. Whittlesey, 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

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

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Cited In (84)

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

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)