Connected Square Network Graphs

dc.contributor.authorSelçuk, B.
dc.date.accessioned2024-09-29T16:16:18Z
dc.date.available2024-09-29T16:16:18Z
dc.date.issued2022
dc.departmentKarabük Üniversitesien_US
dc.description.abstractIn this study, connected square network graphs are introduced and two different definitions are given. Firstly, connected square network graphs are shown to be a Hamilton graph. Further, the labelling algorithm of this graph is obtained by using gray code. Finally, its topological properties are obtained, and conclusion are given. © 2022, Emrah Evren KARA. All rights reserved.en_US
dc.identifier.doi10.32323/ujma.1058116
dc.identifier.endpage63en_US
dc.identifier.issn2619-9653
dc.identifier.issue2en_US
dc.identifier.scopus2-s2.0-85163944644en_US
dc.identifier.scopusqualityN/Aen_US
dc.identifier.startpage57en_US
dc.identifier.urihttps://doi.org/10.32323/ujma.1058116
dc.identifier.urihttps://hdl.handle.net/20.500.14619/8992
dc.identifier.volume5en_US
dc.indekslendigikaynakScopusen_US
dc.language.isoenen_US
dc.publisherEmrah Evren KARAen_US
dc.relation.ispartofUniversal Journal of Mathematics and Applicationsen_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectGraphical indicesen_US
dc.subjectHamilton graphen_US
dc.subjectInterconnection networken_US
dc.titleConnected Square Network Graphsen_US
dc.typeArticleen_US

Dosyalar