A distance based embedding of graphs
Malaya Journal of Matematik · 2021
DOI: 10.26637//mjm0804/0217 ↗Kurz gefasst
Fachartikel in der Zeitschrift Malaya Journal of Matematik, 2021.
Abstract (Originalsprache)
This article introduces a pseudo-metric on simple, connected graphs that measures differences in the numbers of their shortest paths. This induces a natural equivalence relation, and the resulting quotient becomes a metric space. To describe these classes, we use a modified Hosoya polynomial that records shortest-path counts; two graphs are equivalent exactly when this polynomial matches. The metric space is then embedded isometrically into a Euclidean space using these coefficient vectors, and we provide a combinatorial upper bound on the size of the embedded image. This offers a compact framework for comparing graphs via their shortest-path structure.
Zitieren
APA
(2021). A distance based embedding of graphs. Malaya Journal of Matematik. https://doi.org/10.26637//mjm0804/0217
Vancouver
A distance based embedding of graphs. Malaya Journal of Matematik. 2021. doi:10.26637//mjm0804/0217
BibTeX
@article{euvimed2021,
title = {A distance based embedding of graphs},
journal = {Malaya Journal of Matematik},
year = {2021},
doi = {10.26637//mjm0804/0217}
}
EUVIMED