Zobrazit minimální záznam

dc.contributor.authorSnášel, Václav
dc.contributor.authorDráždilová, Pavla
dc.contributor.authorPlatoš, Jan
dc.date.accessioned2018-09-17T11:24:32Z
dc.date.available2018-09-17T11:24:32Z
dc.date.issued2018
dc.identifier.citationPlos One. 2018, vol. 13, issue 8, art. no. e0202181.cs
dc.identifier.issn1932-6203
dc.identifier.urihttp://hdl.handle.net/10084/131892
dc.description.abstractGraphs 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.cs
dc.format.extent4316353 bytes
dc.format.mimetypeapplication/pdf
dc.language.isoencs
dc.publisherPLOScs
dc.relation.ispartofseriesPlos Onecs
dc.relation.urihttp://doi.org/10.1371/journal.pone.0202181cs
dc.rights© 2018 Snasel et al. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.cs
dc.rights.urihttp://creativecommons.org/licenses/by/4.0/cs
dc.titleClosed trail distance in a biconnected graphcs
dc.typearticlecs
dc.identifier.doi10.1371/journal.pone.0202181
dc.rights.accessopenAccesscs
dc.type.versionpublishedVersioncs
dc.type.statusPeer-reviewedcs
dc.description.sourceWeb of Sciencecs
dc.description.volume13cs
dc.description.issue8cs
dc.description.firstpageart. no. e0202181cs
dc.identifier.wos000443374400007


Soubory tohoto záznamu

Tento záznam se objevuje v následujících kolekcích

Zobrazit minimální záznam

© 2018 Snasel et al. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.
Kromě případů, kde je uvedeno jinak, licence tohoto záznamu je © 2018 Snasel et al. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.