Closed trail distance in a biconnected graph

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F18%3A10239116" target="_blank" >RIV/61989100:27240/18:10239116 - isvavai.cz</a>

Výsledek na webu

<a href="https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0202181" target="_blank" >https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0202181</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1371/journal.pone.0202181" target="_blank" >10.1371/journal.pone.0202181</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Closed trail distance in a biconnected graph

Popis výsledku v původním jazyce

Graphs describe and represent many complex structures in the field of social networks, biological, chemical, industrial and transport systems, and others. These graphs are not only connected but often also k-connected (or at least part of them). Different metrics are used to determine the distance between two nodes in the graph. In this article, we propose a novel metric that takes into account the higher degree of connectivity on the part of the graph (for example, biconnected fullerene graphs and fulleroids). Designed metric reflects the cyclical interdependencies among the nodes of the graph. Moreover, a new component model is derived, and the examples of various types of graphs are presented.

Název v anglickém jazyce

Closed trail distance in a biconnected graph

Popis výsledku anglicky

Graphs describe and represent many complex structures in the field of social networks, biological, chemical, industrial and transport systems, and others. These graphs are not only connected but often also k-connected (or at least part of them). Different metrics are used to determine the distance between two nodes in the graph. In this article, we propose a novel metric that takes into account the higher degree of connectivity on the part of the graph (for example, biconnected fullerene graphs and fulleroids). Designed metric reflects the cyclical interdependencies among the nodes of the graph. Moreover, a new component model is derived, and the examples of various types of graphs are presented.

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í

2018

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

PLoS One

ISSN

1932-6203

e-ISSN

—

Svazek periodika

13

Číslo periodika v rámci svazku

8

Stát vydavatele periodika

US - Spojené státy americké

Počet stran výsledku

12

Strana od-do

1-12

Kód UT WoS článku

000443374400007

EID výsledku v databázi Scopus

2-s2.0-85053142711