On full friendly index sets of 1-level and 2-levels N-grids
From MaRDI portal
Publication:335331
DOI10.1016/J.DAM.2016.01.024zbMATH Open1348.05174OpenAlexW2346030772MaRDI QIDQ335331FDOQ335331
Authors: Zhenbin Gao, Guang-Yi Sun, Sin-Min Lee 
Publication date: 2 November 2016
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2016.01.024
Recommendations
- Full friendly index sets of \(P_2 \times P_n\)
- On friendly index sets of 2-regular graphs
- On friendly index sets of \((p,p+1)\)-graphs
- Friendly index sets and friendly index numbers of some graphs
- On friendly index sets of bipartite graphs
- On friendly index set of hypercube \(Q_n\)
- On friendly index sets of total graphs of trees
- scientific article
- Upper bound of embedding index in grid graphs
- Full edge-friendly index sets of complete bipartite graphs
Cites Work
- A-cordial graphs
- On friendly index sets of generalized books
- Title not available (Why is that?)
- On friendly index sets of 2-regular graphs
- Full friendly index sets of Cartesian products of two cycles
- Full friendly index sets and full product-cordial index sets of twisted cylinders
- On friendly index sets of prisms and Möbius ladders
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Full friendly index set. I
- Title not available (Why is that?)
- Full friendly index sets of \(P_2 \times P_n\)
Cited In (3)
This page was built for publication: On full friendly index sets of 1-level and 2-levels N-grids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q335331)
