Group path covering and L(j,k)-labelings of diameter two graphs
DOI10.1016/J.IPL.2011.11.005zbMATH Open1239.05164OpenAlexW2078306621MaRDI QIDQ413258FDOQ413258
Authors: 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
Recommendations
- Relationships between distance two labellings and circular distance two labellings by group path covering.
- \(L (j, k)\)- and circular \(L(j, k)\)-labellings for the products of complete graphs
- Distance two labelings of Cartesian products of complete graphs.
- Group path covering and distance two labeling of graphs
- Labeling products of complete graphs with a condition at distance two
combinatorial problemspath covering\(\lfloor \)j/k\(\rfloor \)-group path coverings\(L(jCartesian products of complete graphsdirect products of complete graphsk)\)-labeling
Coloring of graphs and hypergraphs (05C15) Graph operations (line graphs, products, etc.) (05C76) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Cites Work
- Relating path coverings to vertex labellings with a condition at distance two
- Labelling Graphs with a Condition at Distance 2
- Labeling products of complete graphs with a condition at distance two
- On \(L(d,1)\)-labelings of graphs
- Title not available (Why is that?)
- Labeling trees 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
- Title not available (Why is that?)
- Hamiltonicity and circular distance two labellings
Cited In (2)
This page was built for publication: Group path covering and \(L(j,k)\)-labelings of diameter two graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q413258)
