DC FieldValueLanguage
dc.contributor.authorNémeth, Lászlóen_US
dc.contributor.authorStevanović, Draganen_US
dc.date.accessioned2023-08-11T10:20:13Z-
dc.date.available2023-08-11T10:20:13Z-
dc.date.issued2023-
dc.identifier.issn1451-4966-
dc.identifier.urihttp://researchrepository.mi.sanu.ac.rs/handle/123456789/5133-
dc.description.abstractWe define a chain of cubes as a special part of the 3-dimensional cube grid, and on it, we consider the shortest walks from a base vertex. To a welldefined zig-zag walk on the cube chain, we associate a sequence described by a system of recurrence relations and using a special directed graph we determine its recurrence property. During our process, we enumerate and collect some directed shortest paths in the directed graph. In addition, we present two other examples of our graphical method to transform a system of recurrence equations of several sequences into a single recurrence sequence.en_US
dc.publisherDruštvo matematičara Srbijeen_US
dc.relation.ispartofTeaching of Mathematicsen_US
dc.subjectCube chain | directed graph | graphical solution of recurrence equation system | recurrenceen_US
dc.titleGRAPH SOLUTION OF A SYSTEM OF RECURRENCE EQUATIONSen_US
dc.typeArticleen_US
dc.identifier.doi10.57016/TM-EQWM6024-
dc.identifier.scopus2-s2.0-85162994662-
dc.contributor.affiliationMathematicsen_US
dc.contributor.affiliationMathematical Institute of the Serbian Academy of Sciences and Artsen_US
dc.relation.firstpage5-
dc.relation.lastpage13-
dc.relation.issue1-
dc.relation.volume26-
item.cerifentitytypePublications-
item.openairetypeArticle-
item.fulltextNo Fulltext-
item.grantfulltextnone-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
crisitem.author.orcid0000-0003-2908-305X-

#### Page view(s)

29
checked on May 9, 2024