Labeling subgraph embeddings and cordiality of graphs

MaRDI QIDQ4964829zbMATH OpenFDO

Authors Zhenbin Gao, Ruo-Yuan Han, Sin-Min Lee, Hong-Nan Ren, Gee-Choon Lau

Publication date 4 March 2021

Full work available at URL http://ijmsi.ir/article-1-925-en.html

zbMATH Keywords

\(C_4\)-embedding\(P_2\)-embeddingscordialityfull friendly index setvertex labeling

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Recommendations

• A new approach in finding full friendly indices
• Discussions on full friendly index sets of a class of cubic graphs.
• On friendly index sets of 2-regular graphs
• Friendly indices and fully cordial graphs
• On friendly index sets of the edge-gluing of complete graph and cycles

Cites work

• A dynamic survey of graph labeling
• A-cordial graphs
• 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 6007735 (Why is no real title available?)
• scientific article; zbMATH DE number 6096644 (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 generalized books
• On friendly index sets of prisms and Möbius ladders

Cited in

(2)

• A new approach in finding full friendly indices
• Cordial sets of hypercubes

This page was built for publication: Labeling subgraph embeddings and cordiality of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4964829)