The Uniqueness of [Image: see text]-Matrix Graph Invariants

In this paper, we examine the uniqueness (discrimination power) of a newly proposed graph invariant based on the matrix [Image: see text] defined by Randić et al. In order to do so, we use exhaustively generated graphs instead of special graph classes such as trees only. Using these graph classes al...

Descripción completa

Detalles Bibliográficos
Autores principales: Dehmer, Matthias, Shi, Yongtang
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Public Library of Science 2014
Materias:
Research Article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3879262/
https://www.ncbi.nlm.nih.gov/pubmed/24392099
http://dx.doi.org/10.1371/journal.pone.0083868
_version_ 1782297948420308992
author Dehmer, Matthias
Shi, Yongtang
author_facet Dehmer, Matthias
Shi, Yongtang
author_sort Dehmer, Matthias
collection PubMed
description In this paper, we examine the uniqueness (discrimination power) of a newly proposed graph invariant based on the matrix [Image: see text] defined by Randić et al. In order to do so, we use exhaustively generated graphs instead of special graph classes such as trees only. Using these graph classes allow us to generalize the findings towards complex networks as they usually do not possess any structural constraints. We obtain that the uniqueness of this newly proposed graph invariant is approximately as low as the uniqueness of the Balaban [Image: see text] index on exhaustively generated (general) graphs.
format Online
Article
Text
id pubmed-3879262
institution National Center for Biotechnology Information
language English
publishDate 2014
publisher Public Library of Science
record_format MEDLINE/PubMed
spelling pubmed-38792622014-01-03 The Uniqueness of [Image: see text]-Matrix Graph Invariants Dehmer, Matthias Shi, Yongtang PLoS One Research Article In this paper, we examine the uniqueness (discrimination power) of a newly proposed graph invariant based on the matrix [Image: see text] defined by Randić et al. In order to do so, we use exhaustively generated graphs instead of special graph classes such as trees only. Using these graph classes allow us to generalize the findings towards complex networks as they usually do not possess any structural constraints. We obtain that the uniqueness of this newly proposed graph invariant is approximately as low as the uniqueness of the Balaban [Image: see text] index on exhaustively generated (general) graphs. Public Library of Science 2014-01-02 /pmc/articles/PMC3879262/ /pubmed/24392099 http://dx.doi.org/10.1371/journal.pone.0083868 Text en © 2014 Dehmer, Shi http://creativecommons.org/licenses/by/4.0/ 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 properly credited.
spellingShingle Research Article
Dehmer, Matthias
Shi, Yongtang
The Uniqueness of [Image: see text]-Matrix Graph Invariants
title The Uniqueness of [Image: see text]-Matrix Graph Invariants
title_full The Uniqueness of [Image: see text]-Matrix Graph Invariants
title_fullStr The Uniqueness of [Image: see text]-Matrix Graph Invariants
title_full_unstemmed The Uniqueness of [Image: see text]-Matrix Graph Invariants
title_short The Uniqueness of [Image: see text]-Matrix Graph Invariants
title_sort uniqueness of [image: see text]-matrix graph invariants
topic Research Article
url https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3879262/
https://www.ncbi.nlm.nih.gov/pubmed/24392099
http://dx.doi.org/10.1371/journal.pone.0083868
work_keys_str_mv AT dehmermatthias theuniquenessofimageseetextmatrixgraphinvariants
AT shiyongtang theuniquenessofimageseetextmatrixgraphinvariants
AT dehmermatthias uniquenessofimageseetextmatrixgraphinvariants
AT shiyongtang uniquenessofimageseetextmatrixgraphinvariants

Ejemplares similares