Gelişmiş Arama

Basit öğe kaydını göster

dc.contributor.authorShrimali, Narendra P.en_US
dc.contributor.authorParmar, Yaminien_US
dc.contributor.authorPatel, Mahendra A.en_US
dc.date.accessioned2024-10-08T11:15:31Z
dc.date.available2024-10-08T11:15:31Z
dc.date.issued2024-10
dc.identifier.citationShrimali, Narendra P., Parmar, Y. & Patel, M. A. (2024). Distance magic labeling for some product graphs. TWMS Journal of Applied and Engineering Mathematics, 14(4), 1668-1675.en_US
dc.identifier.issn2146-1147
dc.identifier.issn2587-1013
dc.identifier.urihttps://jaem.isikun.edu.tr/web/index.php/archive/126-vol14no4/1287
dc.identifier.urihttp://belgelik.isikun.edu.tr/xmlui/handleiubelgelik/6139
dc.description.abstractIn this paper, we prove Wt □ G and Wt ⊠ G are not distance magic if graph G contains two vertices with the same neighborhood. And we also prove Wt × C4 (t ≥ 5), W3□Pn and W4 × Pn (n ≥ 3) are not distance magic graphs.en_US
dc.language.isoengen_US
dc.publisherIşık University Pressen_US
dc.relation.ispartofTWMS Journal of Applied and Engineering Mathematicsen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.rightsAttribution-NonCommercial-NoDerivs 3.0 United States*
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/3.0/us/*
dc.subjectCartesian producten_US
dc.subjectDirect producten_US
dc.subjectDistance magic labelingen_US
dc.subjectStrong producten_US
dc.titleDistance magic labeling for some product graphsen_US
dc.typearticleen_US
dc.description.versionPublisher's Versionen_US
dc.identifier.volume14
dc.identifier.issue4
dc.identifier.startpage1668
dc.identifier.endpage1675
dc.peerreviewedYesen_US
dc.publicationstatusPublisheden_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Başka Kurum Yazarıen_US
dc.indekslendigikaynakScopusen_US
dc.indekslendigikaynakEmerging Sources Citation Index (ESCI)en_US


Bu öğenin dosyaları:

Thumbnail

Bu öğe aşağıdaki koleksiyon(lar)da görünmektedir.

Basit öğe kaydını göster

info:eu-repo/semantics/openAccess
Aksi belirtilmediği sürece bu öğenin lisansı: info:eu-repo/semantics/openAccess