A survey on graphs extremal with respect to distance-based topological indices

K Xu, M Liu, I Gutman, B Furtula - MATCH Communications in …, 2014 - scidar.kg.ac.rs
A Survey on Graphs Extremal with Respect to Distance–Based Topological Indices Page 1 A
Survey on Graphs Extremal with Respect to Distance–Based Topological Indices Kexiang Xua …

Metrics for graph comparison: a practitioner's guide

P Wills, FG Meyer - Plos one, 2020 - journals.plos.org
Comparison of graph structure is a ubiquitous task in data analysis and machine learning,
with diverse applications in fields such as neuroscience, cyber security, social network …

[图书][B] Fuzzy graph theory

S Mathew, JN Mordeson, DS Malik - 2018 - Springer
Lotfi Zadeh introduced the concept of a fuzzy subset of a set in 1965 as a way to represent
uncertainty. His ideas have motivated the interest of researchers worldwide. One such …

Semantic measures for the comparison of units of language, concepts or instances from text and knowledge base analysis

S Harispe, S Ranwez, S Janaqi, J Montmain - arXiv preprint arXiv …, 2013 - arxiv.org
Semantic measures are widely used today to estimate the strength of the semantic
relationship between elements of various types: units of language (eg, words, sentences …

[PDF][PDF] The Steiner Wiener index of a graph

X Li, Y Mao, I Gutman - Discussiones Mathematicae Graph …, 2016 - bibliotekanauki.pl
The Wiener index W(G) of a connected graph G, introduced by Wiener in 1947, is defined as
W(G)=u,v∈V(G)d(u,v) where d_G(u,v) is the distance between vertices u and v of G. The …

[图书][B] Advanced topics in fuzzy graph theory

JN Mordeson, S Mathew - 2019 - Springer
Inspired by Lotfi Zadeh's seminal work on fuzzy logic, Azriel Rosenfeld developed
cornerstone papers in fuzzy abstract algebra and fuzzy graph theory. This book is the third …

[PDF][PDF] Inverse problem on the Steiner Wiener index

X Li, Y Mao, I Gutman - Discussiones Mathematicae Graph …, 2017 - bibliotekanauki.pl
The Wiener index W(G) of a connected graph G, introduced by Wiener in 1947, is defined as
W(G)=u,v∈V(G)\d_G(u,v), where d_G(u,v) is the distance (the length a shortest path) …

[HTML][HTML] Orientations of graphs with maximum Wiener index

M Knor, R Škrekovski, A Tepeh - Discrete Applied Mathematics, 2016 - Elsevier
In this paper we study the Wiener index (ie, the total distance or the transmission number) of
not necessarily strongly connected digraphs. In order to do so, if in a digraph there is no …

Semi-Lipschitz functions and machine learning for discrete dynamical systems on graphs

H Falciani, EA Sánchez-Pérez - Machine Learning, 2022 - Springer
Consider a directed tree U and the space of all finite walks on it endowed with a quasi-
pseudo-metric—the space of the strategies S on the graph,—which represent the possible …

Proximity semantics for topic-based abstract argumentation

MCD Budán, ML Cobo, DC Martinez, GR Simari - Information Sciences, 2020 - Elsevier
As we engage in a debate with other parties, it is usual that several issues might come under
discussion. Many of these issues are interrelated by the topic they address, while others …