On the $\lambda$-Number of $Q_n $ and Related Graphs

DOI10.1137/S0895480192242821zbMath0844.05084OpenAlexW2070694622MaRDI QIDQ4863972

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

Related Items (79)

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

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