On Regular Graphs Optimally Labeled with a Condition at Distance Two

DOI10.1137/S0895480101391247MaRDI QIDQ4443140zbMATH OpenOpenAlexFDO

Authors John P. Georges, David 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

distancelabelingprismregular graph

Mathematics Subject Classification ID

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

Recommendations

• Optimal L(j,k)-edge-labeling of regular grids
• scientific article; zbMATH DE number 5036064
• Labeling trees with a condition at distance two.
• scientific article; zbMATH DE number 1185300
• Distance-two labelings of graphs

Cited in

(14)

• On \(L(d,1)\)-labeling of Cartesian product of a cycle and a path
• Lambda number of the power graph of a finite group
• The minimum span of \(L(2,1)\)-labelings of certain generalized Petersen graphs
• Labeling crossed prisms with a condition at distance two
• Recent progress in mathematics and engineering on optimal graph labellings with distance conditions
• A survey on labeling graphs with a condition at distance two
• Exact \(\lambda\)-numbers of generalized Petersen graphs of certain higher-orders and on Möbius strips
• L(2,1)-labelling of generalized prisms
• scientific article; zbMATH DE number 841588 (Why is no real title available?)
• On the L(2, 1)-labelling of block graphs
• Some invariants related to threshold and chain graphs
• L(2,1)-labeling of some zero-divisor graphs associated with commutative rings
• Lambda number of the enhanced power graph of a finite group
• Distance-two labelings of digraphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4443140)