On friendly index sets of the edge-gluing of complete graph and cycles

DOI10.1016/J.AKCEJ.2016.06.004zbMATH Open1348.05181OpenAlexW2465301040MaRDI QIDQ334119FDOQ334119

Authors: Gee-Choon Lau, Zhenbin Gao, Guang-Yi Sun, Sin-Min Lee 

Publication date: 31 October 2016

Published in: AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.akcej.2016.06.004

Recommendations

• On friendly index sets of cyclic silicates
• Full friendly index set. I
• On friendly index sets of bipartite graphs
• scientific article; zbMATH DE number 6007735
• Edge friendly labelings of graph. I.

zbMATH Keywords

cordialityfriendly labelingvertex labeling

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Cites Work

• On friendly index sets of bipartite graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• On friendly index sets of 2-regular graphs
• Title not available (Why is that?)
• The computational complexity of cordial and equitable labelling
• Uniformly cordial graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• The cordiality of one-point union of \(n\) copies of a graph

Cited In (6)

• On friendly index and product-cordial index sets of Möbius-liked graph
• On friendly index sets of cyclic silicates
• Labeling subgraph embeddings and cordiality of graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Friendliness of generalized wheel

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)