Labeling Products of Complete Graphs with a Condition at Distance Two

DOI10.1137/S0895480199351859zbMath0966.05070OpenAlexW2067463837MaRDI QIDQ2706187

Melanie Stein, John P. Georges, David W. Mauro

Publication date: 19 March 2001

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

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

zbMATH Keywords

Cayley graph vertex labeling product of complete graphs $\lambda^j_k$-labeling

Mathematics Subject Classification ID

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

Related Items (57)

Extremal problems on consecutive $L(2,1)$-labelling ⋮ An extremal problem on non-full colorable graphs ⋮ $L(j, k)$-number of direct product of path and cycle ⋮ $L(2, 1)$-labelings of the edge-path-replacement of a graph ⋮ Coloring, location and domination of corona 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 ⋮ Group path covering and $L(j,k)$-labelings of diameter two graphs ⋮ $L(2,1)$-labelling of generalized prisms ⋮ Computing graph invariants on rotagraphs using dynamic algorithm approach: The case of (2, 1)-colorings and independence numbers ⋮ Group path covering and distance two labeling of graphs ⋮ On the $L(2,1)$-labelings of amalgamations of graphs ⋮ On backbone coloring of graphs ⋮ List backbone colouring of graphs ⋮ Unnamed Item ⋮ 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 ⋮ Unnamed Item ⋮ Distance-constrained labellings of Cartesian products of graphs ⋮ $(2,1)$-total labelling of outerplanar graphs ⋮ The $L(2,1)$-labeling on the skew and converse skew products of graphs ⋮ Labelling planar graphs without 4-cycles with a condition on distance two ⋮ Radio number for trees ⋮ $L (j, k)$- and circular $L(j, k)$-labellings for the products of complete graphs ⋮ The $L(2,1)$-labeling on Cartesian sum of graphs ⋮ The $L(2,1)$-labeling on graphs and the frequency assignment problem ⋮ Radio $k$-labeling of paths ⋮ Injective coloring of planar graphs ⋮ Nordhaus-Gaddum-type results for path covering and $L(2,1)$-labeling numbers ⋮ Optimal radio labellings of complete $m$-ary trees ⋮ $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 ⋮ $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 ⋮ On real number labelings and graph invertibility ⋮ A survey on labeling graphs with a condition at distance two ⋮ $L(2,1)$-labelings on the composition of $n$ graphs ⋮ L(1,1)-Labeling of direct product of cycles ⋮ $L(2,1)$-labelings of the edge-multiplicity-paths-replacement of a graph ⋮ Labeling trees with a condition at distance two ⋮ A distance-labelling problem for hypercubes ⋮ On $L(d,1)$-labeling of Cartesian product of a cycle and a path ⋮ Labeling amalgamations of Cartesian products of complete graphs with a condition at distance two ⋮ Labeling trees with a condition at distance two ⋮ $L(h,k)$-labelings of Hamming graphs ⋮ Distance-two labellings of Hamming graphs ⋮ On $L(2,1)$-labelings of Cartesian products of paths and cycles ⋮ 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 ⋮ THE λ-NUMBER OF THE CARTESIAN PRODUCT OF A COMPLETE GRAPH AND A CYCLE ⋮ Distance Labelling Problems for Hypercubes and Hamming Graphs – A Survey ⋮ Radio number for the product of a path and a complete graph

This page was built for publication: Labeling Products of Complete Graphs with a Condition at Distance Two