Group path covering and \(L(j,k)\)-labelings of diameter two graphs

DOI10.1016/J.IPL.2011.11.005zbMath1239.05164OpenAlexW2078306621MaRDI QIDQ413258

Wensong Lin, Feng Wang

Publication date: 4 May 2012

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2011.11.005

zbMATH Keywords

combinatorial problemspath covering\(\lfloor \)j/k\(\rfloor \)-group path coverings\(L(jCartesian products of complete graphsdirect products of complete graphsk)\)-labeling

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph operations (line graphs, products, etc.) (05C76)

Related Items (1)

\(L(d,1)\)-labelings of the edge-path-replacement by factorization of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Relating path coverings to vertex labellings with a condition at distance two
• Labeling trees with a condition at distance two.
• On \(L(d,1)\)-labelings of graphs
• Group path covering and distance two labeling of graphs
• \(L (j, k)\)- and circular \(L(j, k)\)-labellings for the products of complete graphs
• Labeling Products of Complete Graphs with a Condition at Distance Two
• Labelling Graphs with a Condition at Distance 2
• Hamiltonicity and circular distance two labellings

This page was built for publication: Group path covering and \(L(j,k)\)-labelings of diameter two graphs