Cliques Are Bricks for k-CT Graphs

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F21%3A10248800" target="_blank" >RIV/61989100:27240/21:10248800 - isvavai.cz</a>

Výsledek na webu

<a href="https://www.mdpi.com/2227-7390/9/11/1160" target="_blank" >https://www.mdpi.com/2227-7390/9/11/1160</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.3390/math9111160" target="_blank" >10.3390/math9111160</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Cliques Are Bricks for k-CT Graphs

Popis výsledku v původním jazyce

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.

Název v anglickém jazyce

Cliques Are Bricks for k-CT Graphs

Popis výsledku anglicky

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.

Druh

J_imp - Článek v periodiku v databázi Web of Science

CEP obor

—

OECD FORD obor

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Projekt

—

Návaznosti

S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2021

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název periodika

Mathematics

ISSN

2227-7390

e-ISSN

—

Svazek periodika

9

Číslo periodika v rámci svazku

11

Stát vydavatele periodika

CH - Švýcarská konfederace

Počet stran výsledku

9

Strana od-do

—

Kód UT WoS článku

000660251800001

EID výsledku v databázi Scopus

2-s2.0-85107235975