A method on the matrix of graph of torus knot k(2, q) and its Maple application

ArticleAçık Erişim

Özet

In this paper, we introduce a method finding the matrix of graph of connected sum of torus knot K(2, q) for q = 1, 3, 5,⋯ Then, we show that the dimension of the matrix is (q - 1) k + 1, where k is the number of connected sum. Also, for this method a Maple source code is given. © 2002 Elsevier Science Inc. All rights reserved.

Anahtar Kelimeler

RDL Kalıcı Bağlantı (PID)
https://rdlopen.rawdatalibrary.net/r/ebyu/16146Resmi atıflarda kullanılan kalıcı adres
Tam Kayıt
AlanDeğerDil
dc.contributor.authorKopuzlu, Abdullah
dc.contributor.authorUgur, Tamer
dc.date.accessioned2026-10-18T20:30:57.570126254Z
dc.date.available2026-10-18T20:30:57.570126254Z
dc.date.issued2003
dc.description.abstractIn this paper, we introduce a method finding the matrix of graph of connected sum of torus knot K(2, q) for q = 1, 3, 5,⋯ Then, we show that the dimension of the matrix is (q - 1) k + 1, where k is the number of connected sum. Also, for this method a Maple source code is given. © 2002 Elsevier Science Inc. All rights reserved.
dc.identifier.doi10.1016/s0096-3003(02)00258-8
dc.identifier.endpage338
dc.identifier.issn0096-3003
dc.identifier.issue2-3
dc.identifier.scopus2-s2.0-0037420950
dc.identifier.startpage331
dc.identifier.urihttps://rdlopen.rawdatalibrary.net/r/ebyu/16146
dc.identifier.volume141
dc.language.isoen
dc.relation.ispartofApplied Mathematics and Computation
dc.rightsinfo:eu-repo/semantics/openAccess
dc.subjectConnected sum
dc.subjectGraphs
dc.subjectKnot
dc.subjectKnot graph
dc.subjectMaple
dc.subjectMatrix of knot graph
dc.subjectTorus knot
dc.subjectMatrix algebra
dc.subjectPolynomials
dc.subjectTheorem proving
dc.subjectKnot graphs
dc.subjectGraph theory
dc.titleA method on the matrix of graph of torus knot k(2, q) and its Maple application
dc.typeArticle
dspace.entity.typePublication
rdl.citation.scopus0
rdl.source.indexSCOPUS