On 3-total edge product cordial labeling of a carbon nanotube network
From MaRDI portal
Publication:2176162
DOI10.1016/J.AKCEJ.2018.09.001zbMATH Open1444.05122OpenAlexW2890694853WikidataQ129228286 ScholiaQ129228286MaRDI QIDQ2176162FDOQ2176162
Martin Bača, M. Irfan, Andrea Semaničová-Feňovčíková
Publication date: 4 May 2020
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.2018.09.001
Recommendations
Cites Work
- A-cordial graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- The computational complexity of cordial and equitable labelling
- The cordiality of one-point union of \(n\) copies of a graph
- Cordial labeling of \(mK_ n\)
- Title not available (Why is that?)
- Title not available (Why is that?)
- NEPS operations on cordial graphs
- Title not available (Why is that?)
- On \(3\)-total edge product cordial labeling of honeycomb
- 3-TOTAL EDGE PRODUCT CORDIAL LABELING OF GRAPHS
- Title not available (Why is that?)
This page was built for publication: On 3-total edge product cordial labeling of a carbon nanotube network
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2176162)