The orientation number of three complete graphs with linkages
| dc.contributor.author | Rajasekaran, Ganapathy | en_US |
| dc.contributor.author | Sampathkumar, R. | en_US |
| dc.date.accessioned | 2021-01-13T08:21:26Z | |
| dc.date.available | 2021-01-13T08:21:26Z | |
| dc.date.issued | 2021 | |
| dc.identifier.citation | Rajasekaran, 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.issn | 2146-1147 | en_US |
| dc.identifier.issn | 2587-1013 | en_US |
| dc.identifier.uri | http://belgelik.isikun.edu.tr/xmlui/handle/iubelgelik/3016 | |
| dc.identifier.uri | http://jaem.isikun.edu.tr/web/index.php/archive/109-vol11-special-issue/630 | |
| dc.description.abstract | For 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.iso | en | en_US |
| dc.publisher | Işık University Press | en_US |
| dc.relation.ispartof | TWMS Journal of Applied and Engineering Mathematics | en_US |
| dc.rights | info:eu-repo/semantics/openAccess | en_US |
| dc.rights | Attribution-NonCommercial-NoDerivs 3.0 United States | * |
| dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/3.0/us/ | * |
| dc.subject | Complete graphs | en_US |
| dc.subject | Orientation number | en_US |
| dc.title | The orientation number of three complete graphs with linkages | en_US |
| dc.type | Article | en_US |
| dc.description.version | Publisher's Version | en_US |
| dc.identifier.volume | 11 | |
| dc.identifier.issue | SI | |
| dc.identifier.startpage | 13 | |
| dc.identifier.endpage | 24 | |
| dc.peerreviewed | Yes | en_US |
| dc.publicationstatus | Published | en_US |
| dc.relation.publicationcategory | Makale - Uluslararası Hakemli Dergi - Başka Kurum Yazarı | en_US |
Bu öğenin dosyaları:
Bu öğe aşağıdaki koleksiyon(lar)da görünmektedir.
-
JAEM 2021, Vol 11, Special Issue [28]
JAEM 2021, Vol 11, Special Issue koleksiyonunu içerir.
Aksi belirtilmediği sürece bu öğenin lisansı: info:eu-repo/semantics/openAccess
