On Regular Graphs Optimally Labeled with a Condition at Distance Two

DOI10.1137/S0895480101391247zbMath1041.05067OpenAlexW2071020031MaRDI QIDQ4443140

John P. Georges, David W. Mauro

Publication date: 8 January 2004

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

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

zbMATH Keywords

labelingprismdistanceregular graph

Mathematics Subject Classification ID

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

Related Items (11)

The minimum span of \(L(2,1)\)-labelings of certain generalized Petersen graphs ⋮ Labeling crossed prisms with a condition at distance two ⋮ Distance-two labelings of digraphs ⋮ Exact \(\lambda\)-numbers of generalized Petersen graphs of certain higher-orders and on Möbius strips ⋮ \(L(2,1)\)-labelling of generalized prisms ⋮ On theL(2, 1)-labelling of block graphs ⋮ Recent progress in mathematics and engineering on optimal graph labellings with distance conditions ⋮ A survey on labeling graphs with a condition at distance two ⋮ L(1,1)-Labeling of direct product of cycles ⋮ Lambda number of the power graph of a finite group ⋮ On \(L(d,1)\)-labeling of Cartesian product of a cycle and a path

This page was built for publication: On Regular Graphs Optimally Labeled with a Condition at Distance Two