Full edge-friendly index sets of complete bipartite graphs
From MaRDI portal
(Redirected from Publication:5134532)
Recommendations
Cites work
- Full friendly index set. I
- Full friendly index set. II
- Full friendly index sets and full product-cordial index sets of some permutation Petersen graphs
- Full friendly index sets and full product-cordial index sets of twisted cylinders
- Full friendly index sets of \(P_2 \times P_n\)
- Full friendly index sets of Cartesian products of two cycles
- Full friendly index sets of slender and flat cylinder graphs
- scientific article; zbMATH DE number 6096644 (Why is no real title available?)
- scientific article; zbMATH DE number 4214058 (Why is no real title available?)
- scientific article; zbMATH DE number 5139515 (Why is no real title available?)
- scientific article; zbMATH DE number 854567 (Why is no real title available?)
- scientific article; zbMATH DE number 7274720 (Why is no real title available?)
- On friendly index sets of 2-regular graphs
- On friendly index sets of bipartite graphs
- On friendly index sets of generalized books
- Product-cordial index and friendly index of regular graphs
Cited in
(9)- Edge friendly labelings of graph. I.
- scientific article; zbMATH DE number 6096644 (Why is no real title available?)
- On full friendly index sets of 1-level and 2-levels N-grids
- On edge-balanced index sets of some complete k-partite graphs
- Full-edge friendly index sets of fan
- scientific article; zbMATH DE number 7274720 (Why is no real title available?)
- Region indices of edge-friendly labeling of a plane graph
- On the number of unlabeled vertices in edge-friendly labelings of graphs
- Full edge-friendly index sets of one point union of cycles.
This page was built for publication: Full edge-friendly index sets of complete bipartite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5134532)
