Full friendly index set. I
From MaRDI portal
Publication:385157
DOI10.1016/J.DAM.2012.10.028zbMATH Open1277.05149OpenAlexW1993063780MaRDI QIDQ385157FDOQ385157
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
Recommendations
Graph operations (line graphs, products, etc.) (05C76) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Cites Work
- A dynamic survey of graph labeling
- Graph theory with applications
- A-cordial graphs
- 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?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The computational complexity of cordial and equitable labelling
- Uniformly cordial graphs
- Full friendly index sets of \(P_2 \times P_n\)
- Cordial labeling of \(mK_ n\)
- On cordial and balanced labelings of graphs
- The friendly index set of \(P_m\times P_n\)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The bisection width of cubic graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (28)
- Neighbourhood \(V_4\)-magic labeling of some star and path related graphs
- The friendly index set of \(P_m\times P_n\)
- Title not available (Why is that?)
- Edge friendly labelings of graph. I.
- Full friendly index set. II
- Discussions on full friendly index sets of a class of cubic graphs.
- Region indices of edge-friendly labeling of a plane graph
- Friendly indices and fully cordial graphs
- Extreme friendly indices of \(C_m\times P_n\)
- On friendly index sets of generalized books
- On friendly index sets of \((p,p+1)\)-graphs
- (2, 3)-cordial trees and paths
- (2, 3)-cordial oriented hypercubes
- Full friendly index sets of spiders.
- 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
- Full-edge friendly index sets of fan
- Full-edge friendly index sets of gear graph
- Full friendly index sets of \(P_2 \times P_n\)
- A new approach in finding full friendly indices
- On friendly index sets of \(k\)-galaxies
- On a conjecture concerning the friendly index sets of trees
- 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
- Friendly index sets and friendly index numbers of some graphs
- On friendly index set of hypercube \(Q_n\)
- Full friendly index sets of Cartesian products of two cycles
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)
