The edge span of distance two labellings of graphs
From MaRDI portal
Publication:5928417
DOI10.11650/twjm/1500407301zbMath0967.05059MaRDI QIDQ5928417
Publication date: 30 August 2001
Published in: Taiwanese Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.11650/twjm/1500407301
05C90: Applications of graph theory
05C12: Distance in graphs
05C78: Graph labelling (graceful graphs, bandwidth, etc.)
Related Items
Distance-two labelings of digraphs, The \(L(2,1)\)-labeling on Cartesian sum of graphs, The \(L(2,1)\)-labeling of \(K_{1,n}\)-free graphs and its applications, On \(L(d,1)\)-labeling of Cartesian product of a cycle and a path, Combinatorial optimization in system configuration design, On \(L(2,1)\)-labelings of Cartesian products of paths and cycles, Distance-two labelings of graphs, A survey on labeling graphs with a condition at distance two