Relationships between distance two labellings and circular distance two labellings by group path covering.

zbMATH Open1413.05351MaRDI QIDQ2829084FDOQ2829084

Authors: Xiaohua Liu, Hongxia Sun, Feng Wang 

Publication date: 26 October 2016

Published in: Ars Combinatoria (Search for Journal in Brave)

Recommendations

• Group path covering and \(L(j,k)\)-labelings of diameter two graphs
• \(L (2,1)\)-circular labelings of Cartesian products of complete graphs
• \(L (j, k)\)- and circular \(L(j, k)\)-labellings for the products of complete graphs
• On circular-L(2, 1)-labellings of products of graphs
• Group path covering and distance two labeling of graphs

zbMATH Keywords

product graphdistance two labelling\(t\)-group path coveringassignment problem in MCcircular distance two labelling

Mathematics Subject Classification ID

Graph operations (line graphs, products, etc.) (05C76) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Cited In (6)

• Group path covering and \(L(j,k)\)-labelings of diameter two graphs
• Hamiltonicity and circular distance two labellings
• Relating path coverings to vertex labellings with a condition at distance two
• Group path covering and distance two labeling of graphs
• \(L (j, k)\)- and circular \(L(j, k)\)-labellings for the products of complete graphs
• Labelling graphs with the circular difference

This page was built for publication: Relationships between distance two labellings and circular distance two labellings by group path covering.

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