All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Closed trail distance in a biconnected graph

The result's identifiers

  • Result code in 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>

  • Result on the web

    <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>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Closed trail distance in a biconnected graph

  • Original language description

    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.

  • Czech name

  • Czech description

Classification

  • Type

    J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database

  • CEP classification

  • OECD FORD branch

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

Result continuities

  • Project

  • Continuities

    S - Specificky vyzkum na vysokych skolach

Others

  • Publication year

    2018

  • Confidentiality

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

Data specific for result type

  • Name of the periodical

    PLoS One

  • ISSN

    1932-6203

  • e-ISSN

  • Volume of the periodical

    13

  • Issue of the periodical within the volume

    8

  • Country of publishing house

    US - UNITED STATES

  • Number of pages

    12

  • Pages from-to

    1-12

  • UT code for WoS article

    000443374400007

  • EID of the result in the Scopus database

    2-s2.0-85053142711