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

DOI10.1016/J.IPL.2011.11.005MaRDI QIDQ413258zbMATH OpenOpenAlexFDO

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

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 operations (line graphs, products, etc.) (05C76) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

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

Cites work

• scientific article; zbMATH DE number 1185300 (Why is no real title available?)
• scientific article; zbMATH DE number 1439442 (Why is no real title available?)
• Group path covering and distance two labeling of graphs
• Hamiltonicity and circular distance two labellings
• Labeling products of complete graphs with a condition at distance two
• Labeling trees with a condition at distance two.
• Labelling Graphs with a Condition at Distance 2
• On \(L(d,1)\)-labelings of graphs
• Relating path coverings to vertex labellings with a condition at distance two
• \(L (j, k)\)- and circular \(L(j, k)\)-labellings for the products of complete graphs

Cited in

(4)

• Group path covering and distance two labeling of graphs
• Nordhaus-Gaddum-type results for path covering and \(L(2,1)\)-labeling numbers
• \(L(d,1)\)-labelings of the edge-path-replacement by factorization of graphs
• Relationships between distance two labellings and circular distance two labellings by group path covering.

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)