On friendly index sets of the edge-gluing of complete graph and cycles
From MaRDI portal
(Redirected from Publication:334119)
Recommendations
Cites work
- scientific article; zbMATH DE number 4210187 (Why is no real title available?)
- scientific article; zbMATH DE number 5139515 (Why is no real title available?)
- scientific article; zbMATH DE number 54791 (Why is no real title available?)
- scientific article; zbMATH DE number 3997850 (Why is no real title available?)
- scientific article; zbMATH DE number 5206696 (Why is no real title available?)
- On friendly index sets of 2-regular graphs
- On friendly index sets of bipartite graphs
- The computational complexity of cordial and equitable labelling
- The cordiality of one-point union of \(n\) copies of a graph
- Uniformly cordial graphs
Cited in
(6)- On friendly index sets of cyclic silicates
- Labeling subgraph embeddings and cordiality of graphs
- On friendly index and product-cordial index sets of Möbius-liked graph
- Friendliness of generalized wheel
- scientific article; zbMATH DE number 6007735 (Why is no real title available?)
- scientific article; zbMATH DE number 6096644 (Why is no real title available?)
This page was built for publication: On friendly index sets of the edge-gluing of complete graph and cycles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q334119)