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

MaRDI QIDQ2829084zbMATH OpenFDO

Authors Xiaohua Liu, Hongxia Sun, Feng Wang

Publication date 26 October 2016

Published in Ars Combinatoria (Search for Journal in Brave)

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)

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

Cited in

(6)

• Group path covering and \(L(j,k)\)-labelings of diameter two graphs
• Relating path coverings to vertex labellings with a condition at distance two
• Group path covering and distance two labeling of graphs
• Hamiltonicity and circular distance two labellings
• \(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)