Full friendly index set. I

DOI10.1016/J.DAM.2012.10.028MaRDI QIDQ385157zbMATHOpenAlexFDO

Authors Deepa Sinha, Jaspreet Kaur

Publication date 29 November 2013

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2012.10.028

zbMATH Keywords

cordial labelingfriendly labelingfull friendly index set

Mathematics Subject Classification ID

Graph operations (line graphs, products, etc.) (05C76) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Recommendations

• Full friendly index set. II
• Full friendly index sets of Cartesian products of two cycles
• Full friendly index sets of \(P_2 \times P_n\)
• Friendly index sets and friendly index numbers of some graphs
• Extreme friendly indices of \(C_m\times P_n\)

Cites work

• scientific article; zbMATH DE number 4174982 (Why is no real title available?)
• scientific article; zbMATH DE number 4179408 (Why is no real title available?)
• scientific article; zbMATH DE number 4210188 (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 3458691 (Why is no real title available?)
• scientific article; zbMATH DE number 3596873 (Why is no real title available?)
• scientific article; zbMATH DE number 1026281 (Why is no real title available?)
• scientific article; zbMATH DE number 1088659 (Why is no real title available?)
• scientific article; zbMATH DE number 3997850 (Why is no real title available?)
• scientific article; zbMATH DE number 4120211 (Why is no real title available?)
• scientific article; zbMATH DE number 4187864 (Why is no real title available?)
• A dynamic survey of graph labeling
• A-cordial graphs
• Cordial labeling of \(mK_ n\)
• Full friendly index sets of \(P_2 \times P_n\)
• Graph theory with applications
• On cordial and balanced labelings of graphs
• On friendly index sets of 2-regular graphs
• On friendly index sets of bipartite graphs
• The bisection width of cubic graphs
• The computational complexity of cordial and equitable labelling
• The friendly index set of \(P_m\times P_n\)
• Uniformly cordial graphs

Cited in

(29)

• Full-edge friendly index sets of gear graph
• scientific article; zbMATH DE number 7274720 (Why is no real title available?)
• Discussions on full friendly index sets of a class of cubic graphs.
• Full friendly index set. II
• On friendly index sets of \((p,p+1)\)-graphs
• Full friendly index sets of \(P_2 \times P_n\)
• A new approach in finding full friendly indices
• Full edge-friendly index sets of one point union of cycles.
• On friendly index set of hypercube \(Q_n\)
• Neighbourhood \(V_4\)-magic labeling of some star and path related graphs
• (2, 3)-cordial trees and paths
• (2, 3)-cordial oriented hypercubes
• On a conjecture concerning the friendly index sets of trees
• Region indices of edge-friendly labeling of a plane graph
• On friendly index sets of generalized books
• Full friendly index sets of spiders.
• Full friendly index sets of Cartesian products of two cycles
• Friendly indices and fully cordial graphs
• Full-edge friendly index sets of fan
• The friendly index set of \(P_m\times P_n\)
• Full friendly index sets of slender and flat cylinder graphs
• Full friendly index sets and full product-cordial index sets of some permutation Petersen graphs
• Edge friendly labelings of graph. I.
• Full edge-friendly index sets of complete bipartite graphs
• On friendly index sets of the edge-gluing of complete graph and cycles
• On full friendly index sets of 1-level and 2-levels N-grids
• On friendly index sets of \(k\)-galaxies
• Extreme friendly indices of \(C_m\times P_n\)
• Friendly index sets and friendly index numbers of some graphs

This page was built for publication: Full friendly index set. I

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