Gelişmiş Arama

Basit öğe kaydını göster

dc.contributor.authorRajasekaran, Ganapathyen_US
dc.contributor.authorSampathkumar, R.en_US
dc.date.accessioned2021-01-13T08:21:26Z
dc.date.available2021-01-13T08:21:26Z
dc.date.issued2021
dc.identifier.citationRajasekaran, G. & Sampathkumar, R. (2021). The orientation number of three complete graphs with linkages. TWMS Journal of Applied and Engineering Mathematics, 11(SI), 11-24.en_US
dc.identifier.issn2146-1147en_US
dc.identifier.issn2587-1013en_US
dc.identifier.urihttp://belgelik.isikun.edu.tr/xmlui/handle/iubelgelik/3016
dc.identifier.urihttp://jaem.isikun.edu.tr/web/index.php/archive/109-vol11-special-issue/630
dc.description.abstractFor a graph G, let D(G) be the set of all strong orientations of G. The orientation number of G is d~(G) = min{d(D)|D ? D(G)}, where d(D) denotes the diameter of the digraph D. In this paper, we consider the problem of determining the orientation number of three complete graphs with linkages.en_US
dc.language.isoenen_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.subjectComplete graphsen_US
dc.subjectOrientation numberen_US
dc.titleThe orientation number of three complete graphs with linkagesen_US
dc.typeArticleen_US
dc.description.versionPublisher's Versionen_US
dc.identifier.volume11
dc.identifier.issueSI
dc.identifier.startpage13
dc.identifier.endpage24
dc.peerreviewedYesen_US
dc.publicationstatusPublisheden_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Başka Kurum Yazarı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