dc.contributor.author | Snášel, Václav | |
dc.contributor.author | Dráždilová, Pavla | |
dc.contributor.author | Platoš, Jan | |
dc.date.accessioned | 2021-09-06T10:48:58Z | |
dc.date.available | 2021-09-06T10:48:58Z | |
dc.date.issued | 2021 | |
dc.identifier.citation | Mathematics. 2021, vol. 9, issue 11, art. no. 1160. | cs |
dc.identifier.issn | 2227-7390 | |
dc.identifier.uri | http://hdl.handle.net/10084/145155 | |
dc.description.abstract | Many real networks in biology, chemistry, industry, ecological systems, or social networks have an inherent structure of simplicial complexes reflecting many-body interactions. Over the past few decades, a variety of complex systems have been successfully described as networks whose links connect interacting pairs of nodes. Simplicial complexes capture the many-body interactions between two or more nodes and generalized network structures to allow us to go beyond the framework of pairwise interactions. Therefore, to analyze the topological and dynamic properties of simplicial complex networks, the closed trail metric is proposed here. In this article, we focus on the evolution of simplicial complex networks from clicks and k-CT graphs. This approach is used to describe the evolution of real simplicial complex networks. We conclude with a summary of composition k-CT graphs (glued graphs); their closed trail distances are in a specified range. | cs |
dc.language.iso | en | cs |
dc.publisher | MDPI | cs |
dc.relation.ispartofseries | Mathematics | cs |
dc.relation.uri | https://doi.org/10.3390/math9111160 | cs |
dc.rights | © 2021 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license. | cs |
dc.rights.uri | http://creativecommons.org/licenses/by/4.0/ | cs |
dc.subject | cyclic distance | cs |
dc.subject | closed trail distance | cs |
dc.subject | glued graph | cs |
dc.subject | cyclic structure | cs |
dc.subject | higher-order structure | cs |
dc.title | Cliques are bricks for k-CT graphs | cs |
dc.type | article | cs |
dc.identifier.doi | 10.3390/math9111160 | |
dc.rights.access | openAccess | cs |
dc.type.version | publishedVersion | cs |
dc.type.status | Peer-reviewed | cs |
dc.description.source | Web of Science | cs |
dc.description.volume | 9 | cs |
dc.description.issue | 11 | cs |
dc.description.firstpage | art. no. 1160 | cs |
dc.identifier.wos | 000660251800001 | |